Problem 2926 · Hard

Maximum Balanced Subsequence Sum

Rewriting the balance rule as nums[i] - i non-decreasing turns the problem into a best-chain dynamic program.

Open the interactive visualisation