Dynamic Programming Optimization

Problems on dynamic programming optimization, including the convex hull trick, divide-and-conquer optimization, Knuth's optimization, monotone queue optimization and speeding up transitions with prefix sums or segment trees.

The introduction in the Dynamic programming section covers the method these techniques speed up. Related problem sets are under Dynamic programming and Convex hull.