Maximum Sum Increasing Subsequence - State Change

The dp definition changes slightly: $dp[i]$ = maximum sum of increasing subsequence ending at index $i$ Base case: $dp[i] = nums[i]$ for all $i$.

Each element alone is a valid subsequence with sum equal to itself. Transition: $dp[i] = \max(dp[j] + nums[i])$ for all $j < i$ where $nums[j] < nums[i]$. The answer is $\max(dp)$, not $dp[n-1]$. Same structure as LIS, different improvement target.