for (int i = 1; i <= n; i++) long long x; cin >> x; x -= i; // transform to non-decreasing problem // Add
[ dp[i] = \min_j < i (dp[j] + |a_i - a_j| \cdot C + \textconstant) ] slope hack
What is the Slope Hack? The slope hack (also known as the "convex trick" or "slope trick" in competitive programming) is a technique for optimizing DP (Dynamic Programming) transitions of the form: for (int i = 1; i <= n;