##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
Sum instead of length
The dp definition changes slightly: = maximum sum of increasing subsequence ending at index Base case: for all .
Each element alone is a valid subsequence with sum equal to itself. Transition: for all where . The answer is , not . Same structure as LIS, different improvement target. Understanding this concept will help you solve more complex problems.
