[Reprint] Provincial Selection Learning Algorithm (Pit Filling Record)

Cpoy from hzwer @ http://hzwer.com/1234.html
1.1 Basic data structure

1. array

2. linked list, doubly linked list

3. queue, monotonic queue, deque

4. stack, monotonic stack

1.2 Intermediate data structures

1. heap

2. Union search and weighted union search

3. hash table

   natural overflow

   double hash

1.3 Advanced Data Structures

1. tree array

2. Line segment tree, line segment tree merge

3. Balanced tree

   Treap random balanced binary tree

   Splay stretch tree

   • Scapegoat Tree

4. block array, block linked list

5.* Tree cover tree

线段树套线段树

线段树套平衡树

* 平衡树套线段树

6. Can be stacked

左偏树

*配对堆

1. KDtree, quadtree

1.4 Persistent Data Structures

1. Persistent segment tree

   Chairman tree

2. • Persistent Balanced Tree
3. • Persistent block array

1.5 String related algorithms and data structures

1. km²

2. AC automaton

3. suffix array

4. * suffix tree

5. *suffix automaton

6. Dictionary tree Trie

7. manacher

1.6 Graph Theory Related

1. minimum spanning tree

   prim

   kruskal

2. Shortest Short, Secondary Short, K ​​Short

   spfa

   dijkstra

   floyd

3. Connectivity of graphs

   connected components

   cut point, cut edge

4. network flow

   maximum flow

   Minimum discount

   expense flow

   Score planning

5. tree correlation

   Multiplication on the tree, common ancestor

   tree chain segmentation

   Tree divide and conquer algorithm (point divide and conquer, edge divide and conquer, *dynamic? tree divide and conquer)

   Dynamic tree (LCT, *tree chunking)

   virtual tree

   *prufer encoding

6. topological sort

7. Euler diagram

8. binary picture

   *KM algorithm

   Hungarian algorithm

1.7 Mathematics related

1. (Extended) Euclidean Algorithm, Sieve Method, Fast Power

   Feishu theorem

   more subtractive

2. Euler function and *reduce power method

3. Fermat's little theorem

4. Permutations

   lucas theorem

5. multiplicative inverse

6. matrix multiplication

7. Mathematical Expectation and Probability

8. game theory

   sg function

   tree trimming game

9. *Lagrange multiplier method

10. Chinese remainder theorem

11. Linear Programming and Network Flow

12. Simplex Linear Programming

13. Simpson Points

14. Modular system of linear equations

15. Inclusion and Exclusion Principle and Mobius Inversion

16. permutation group

17. Fast Fourier Transform

18. * Small Step Method (BSGS), Extended BSGS

1.8 Dynamic Programming

1. general, knapsack, shape pressure, interval, ring, tree, digital dynamic programming

   memoized search

   Steiner tree

   Nine lectures on backpack

2. Slope Optimization and *Quad Inequality Optimization

3. Ring + Dynamic Programming on Outgoing Trees

4. * Plug dynamic programming

1.9 Computational geometry

1. Computational Geometry Fundamentals

2. 3D Computational Geometry Preliminary

3. Trapezoid and Triangulation

4. Rotary jam

5. half plane intersection

6. pick theorem

7. scan line

1.10 Search related

1. bfs，dfs

2. A* algorithm

3. Iteratively deepen the search, two-way wide search

1.11 Special Algorithms

1. Mo team algorithm, *Mo team on the tree

2. Simulated Annealing

3. Hill Climbing Algorithm

4. random increment method

1.12 Other important tools and methods

1. Simulation and Greed

1. Two points, three points method (for partial derivatives)

2. Divide and conquer, CDQ divide and conquer

3. High precision

4. offline

5. ST table

1.13 STL

1. map

2. priority_queue

3. set

4. bitset

5. rope

1.14 Uncommon Algorithms

1. * Zhu ​​Liu algorithm

2. * Chord diagram and interval diagram