[go] summary of Provincial selection algorithm

1.1 Basic data structures

1. arrays

2. Linked list, doubly linked list

3. queue, monotone queue, double-ended queue

4. stack, monotonic Stack

1.2 Intermediate data Structures

1. heap

2. and the collection and the right to search and set

3. Hash Table

Natural overflow

Double Hash

1.3 Advanced data structures

1. Tree-like Array

2. Segment tree, Segment tree Merge

3. Balance Tree

treap stochastic balanced binary tree

splay Stretching tree

* Scapegoat Tree scapegoat

4. Block array, Block List

5.* Tree Set Tree

Line segment tree Set segment tree

Line Tree Set balance tree

* Balanced Tree-set Line segment tree

6. Can be stacked

left-leaning Tree

* Paired Heap

7. *kdtree,* Four Points tree

1.4 Persistent data structures

1. Can persist line tree

Chairman Tree

2. * Can persist the balance tree

3. * Can persist block array

1.5 string-related algorithms and data structures

1. KMP

2. AC Automatic Machine

3. suffix array

4. * Suffix Tree

5. * Suffix automata

6. Dictionary Tree Trie

7. Manacher

1.6 Graph theory Related

1. Minimum Spanning Tree

Prim

Kruskal

2. Shortest path, short circuit, k short Circuit

Spfa

Dijkstra

Floyd

3. Connectivity of graphs

Connected components

Cut the spot, cut the Edge.

4. Network Streaming

Maximum Flow

Minimum cut

Cost flow

Fractional planning

5. tree-related

multiplied on the tree, the common ancestor

Tree Chain split

the partition algorithm of the tree (point division, side division, * dynamic?) Tree divide and Conquer)

Dynamic Tree (lct,* tree tiles)

Virtual tree

*prufer encoding

7. Topology Sequencing

8. Eulerian Graph

9. Two-minute Chart

*KM algorithm

Hungarian algorithm

1.7 mathematics-related

1. (extended) Euclidean algorithm, sieve method, fast Power

The theorem of Fiji Shu

More subtractive loss Surgery

2. Euler functions and * Power-down Dafa

3. Fermat theorem

4. Permutations and combinations

Lucas theorem

5. Multiplication Inverse element

6. Matrix Multiplication

7. Mathematical Expectations and probabilities

8. Game Theory

sg function

the tree to cut the edge game

9. * Lagrange Multiplier method

10. Chinese Remainder theorem

11. Linear Programming and network flow

12. Simple Linear programming

13. Simpson points

14. Modular Linear Equation set

15. The principle of tolerance and the inversion of the MO

16. Permutation Group

17. Fast Fourier transform

18. * Stride Step method (bsgs), Extended Bsgs

1.8 Dynamic Planning

1. general, backpack, pressure, interval, ring, tree, Digital Dynamic Planning

Memory Search

Eectilinear

Backpack Nine talk

2. Slope optimization and * Quadrilateral inequality optimization

3. Dynamic planning on the ring + outward tree

4. * Plug Dynamic Planning

1.9 Calculating geometry

1. Calculating the geometric basis

2. Three-dimensional calculation geometry preliminary

3. * trapezoid Split and * Triangle split

4. Rotating Jam

5. Half-plane Intersection

6. Pick theorem

7. Scan Line

1.10 Search Related

1. Bfs,dfs

2. A * algorithm

3. Iterative deepening search, two-way wide searching

1.11 Special Algorithms

1. MO Team algorithm, * The tree on the MO team

2. Simulated annealing

3. Mountain climbing algorithm

4. Random Increment method

1.12 Other important tools and methods

1. Simulation and greed

2. Two points, Three-point method (for biased Guidance)

3. Divide and conquer, CDQ

4. High Accuracy

5. Offline

6. St Table

1.13 STL

1. map

2. priority_queue

3. Set

4. Bitset

5. Rope

1.14 Non-common Algorithms

1. * Zhu Liu Algorithm

2. * Chord chart and interval diagram

[go] summary of Provincial selection algorithm