Knuth Optimization - Dynamic Programming
Knuth Optimization은 Dynamic Programming에서 점화식이 특정 조건을 만족할 때 활용할 수 있는 최적화 기법이다. 조건 1) DP 점화식 꼴 $D[i][j] = \min_{i < k < j}(D[i][k] + D[k][j]) + C[i][j]$ 조건 2) Quadrangle Inequalty (사각부등식) $C[a][c] + C[b][d] \leq C[a][d] + C[b][c], a \leq b \leq c ..
공부
2016.06.23 15:03
공지사항
- Total
- 102,791
- Today
- 48
- Yesterday
- 78
링크
TAG
- optimization
- z-trening
- USACO
- ioi
- moore
- Parametric Search
- IOI2013
- BOI
- Knuth Optimization
- Boyer-Moore Majority Vote Algorithm
- BOI 2009
- Algorithm
- idea
- TRIE
- majority
- Divide & Conquer
- Tree
- Segment tree
- Dynamic Pramming
- dynamic programming
- IOI2011
- IOI2014
- Greedy Method
- BOI 2001
- HackerRank
- vote
- Dijkstra
- IOI2012
- Boyer
- Splay Tree