Problem 3892 · Hard

Minimum Operations to Achieve At Least K Peaks

On a ring of values, bump entries upward until a chosen count of local maxima exists, spending as few bumps as possible.

Open the interactive visualisation