##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
Making it non-decreasing
Strictly increasing means . This is hard to work with. Transform it: let . Now you want to be non-decreasing instead.
Why? If , then automatically. The cost stays the same: changing to is the same as changing to . This transform converts strict inequality to non-strict. Now you can use the classic non-decreasing array technique with heaps.
