D&C improvement: For layered DP like . Uses divide and conquer to exploit monotonicity. per layer. Knuth's improvement: For interval DP like .
Uses a double bound on . total. Both require QI. The difference is the DP structure: layers vs intervals.
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
$ curl repovive.com/roadmaps/dynamic-programming/d-c-and-knuth-optimization/d-c-and-knuth-overview
░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░██████████████████████████████████████████████████████████████████████████████████████████████████