##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
The twist
Let = maximum sum of a valid subsequence ending at index (must include ). The transition: . You take the best previous subsequence sum if it's positive, otherwise start fresh. The is the key difference from Jump Game VI.
If all previous subsequences ending in the window have negative sum, you're better off starting a new subsequence at .
