##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
summary
D&C improvement works for layered DP: .
Prove QI holds, which implies monotonicity of optimal splits.
Solve middle first, then recurse with bounded search ranges.
Each recursion level does work. Total: per layer. The pattern: partition problems, layer-by-layer DP, cost satisfying QI. Apply these patterns when you encounter similar problems.
