Concepts3
⚙️AlgorithmAdvanced
Divide and Conquer DP Optimization
Divide and Conquer DP optimization speeds up DP transitions of the form dp[i][j] = min over k of dp[i-1][k] + C(k, j) when the optimal k is monotone in j.
#divide and conquer dp#monge array#quadrangle inequality+10
⚙️AlgorithmAdvanced
Knuth Optimization
Knuth Optimization speeds up a class of interval dynamic programming (DP) from O(n^3) to O(n^2) by exploiting the monotonicity of optimal split points.
#knuth optimization#interval dp#quadrangle inequality+12
⚙️AlgorithmIntermediate
Interval DP
Interval DP solves problems where the optimal answer for a segment [i, j] depends on answers of its subsegments.
#interval dp#matrix chain multiplication#burst balloons+12