Persona
Search: BFS, DFS, IDA*, Hash
Thoughts design: Greedy, binary, Tree point, Merge sort, Ruler method
Math: extended Euclidean， prime, Eulers function, Fast matrix power, Gauss elimination
Data structure: STL(priority queue, map, multiset), Monotone structure(queue, stack, sliding window), disjoint set
Dynamic planning： classic problem， Tree DP, status compress DP
Math: Game(bash, nim, Fibonacci, Wythoff)， derangement， inverse element, combination of recursive
Graphy theory: minimal spanning tree， maximum matching， shortest path(floyd, dijkstra, bellman-ford, SPFA)
Computation geometry: line segment intersection, Cross product， Polygon area
Data structure: segment tree, tree attay, KMP, Trie
Graphy theory: network flow(max-flow, minimum cost flow), strongly connected components
Team Necessary
Data structure: splay tree, AC automantic machine, suffix array, Heavy-light Decomposition， balanced tree(treap), chairman tree, block, RMQ, LCA
Dynamic planing: digit DP, interval DP, data structure optimize DP(gradient optimize, monotonic queue, quadrilateral inequality, binary system)
Computation geometry： convex closure, Half-plane Intersection, area of circles
Math: SG function, matrix, Fermat’s little theorem， Chinese remainder theorem, pick theorem, probability and expectation(probability DP), FFT, Simpson, displace(polya theorem, Burnside lemma), combinatorial mathematics(interval counting, Catalan number， Stirling number, counting order)
Graphy theory: connected component(cut point, bridge, Biconnect), 2SAT, Differential Constrain, minimal cut, Eulerian circuit
Graphy theory: Network flow(upper and lower bound, max density subgraph, largest closed subgraph), most perfect matching
Team Stronger
Sundry: simulated annealing, plug DP, DLX, divide and conquer tree
Data sturcture: dynamic tree, kd tree, suffix automantic machine, Mo team, Persistent data structure
Math: generation function, liner programming, Mobius inversion, fast number theoretic transform
Graphy Theory: stable matching, the Kth short path, Second-best Minmum Spanning Tree, maximum clique, hamiltonian circuit, Minimum spanning tree
Computation geometry: Rotating calipers, 3D convex hull, Minimum Circumscribed Circle, Affine transformation matrix， motion planning