Part of the OI did not learn the knowledge or the need to strengthen the

data structure

　　1. balanced tree

　　2. Can persistent data structures (Chairman of the tree)

　　3. Do team

　　4. LCT

　　The partition (partition point + CDQ)

　　6. tree cover tree

---

DP

　　Gaussian elimination process of aftereffect

　　2. Decision monotonic

　　3. tree DP (changing root, multiplication)

---

String

　　1. KMP (fail tree, DP)

　　2. AC automaton

　　3. Trie (persistence-Trie, 01Trie, Trie on DP)

　　4. The suffix array, a suffix automaton

　　5. Manacher

---

Tree-related issues

　　1. virtual tree

　　2. dsu on tree

　　3. Long-chain split

　　4. The diameter of the center of gravity properties

---

mathematics

　　1. Mobius inversion

　　2. The Gaussian elimination

　　3. Linear yl

　　4.01 scores planning

　　5. Game Theory

　　6. all kinds of Theorem

---

Graph Theory

　　1. The network flow (modeling), a bipartite graph

　　2. spanning tree

　　3. disjoint-set to maintain connectivity

---

other

　　1. greedy