1. SPOJ 'COT - Count on a tree'
2. SPOJ 'MKTHNUM - K-th Number'
3. Codeforces Round #140 (Div. 1) Problem E. Noble Knight's Path
'Problem Solving > Data Structure' 카테고리의 다른 글
| C++ [STL] vector 구현 (1) | 2020.08.05 |
|---|---|
| Heavy Light Decomposition (2) | 2018.02.15 |
| Rope (0) | 2017.01.19 |
| Persistent Segment Tree (1) | 2016.06.14 |
| 트리에서의 Sqrt Decomposition (0) | 2016.05.19 |
댓글