Maximum Sum Increasing Subsequence — Solution & Editorial

Back to the Problem

DP where dp[i] is the best increasing-subsequence sum ending at i, extending from any smaller earlier element.

Complexity: O(N²)