##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
Maximum sum with gap constraint
Find maximum sum of subsequence where adjacent elements are at most apart. = max sum ending at . Transition: . The handles starting fresh. Example: , . . At each step, query window max and add current.
Answer: (subsequence 10, 2, 5, 20). Monotonic queue handles the window max in amortized.
