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