3717. Minimum Operations to Make the Array Beautiful

Use dynamic programming.

For each index i, compute dp[i][val] where dp[i][val] is the minimum number of increments needed to make position i equal to val.

Carefully combine DP states for index i with those for index i - 1.