You have numbers. Change each to any value. The cost of changing to is . Make the array strictly increasing with minimum total cost. Naive DP (dynamic programming): = min cost for first elements with . Transition: .
This is . With , impossible. Think about the shape of as a function of the last value. It's piecewise linear and convex. You'll track slope changes instead of all values.