Oi algorithm summary [outline]

1.1 basic Data Structure

1. Arrays

2. linked list, doubly linked list

3. queue, monotone queue, double-ended queue

4. stack, monotonic stack

1.2 intermediate Data structure

1. Heap

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

3. Hash table

Natural Overflow

Double hash

1.3 Advanced Data structure

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

7 . can and heap

left-leaning tree

* paired heap

8 . *kdtree,* four-minute tree

1.4 Persistent Data structure

1. can persist line tree

Chairman Tree

2. * can persist the balance tree

3. * can persist block array

1.5 string correlation algorithm and data structure

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

Kruska L

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 chunking)

Virtual Tree

*prufer Encoding

7. topology sequencing

8. Eulerian graph

9. two-part diagram

*km Algorithm

Hungarian algorithm

1.7 Math-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

China's remainder theorem

linear programming and network flow

Simple Linear Programming

Simpson points

Modular linear equations

the principle of tolerant repulsion and the inverse of the Mo .

Permutation group

Quick Fourier transform

* Stride Step (bsgs), extended bsgs

1.8 Dynamic Planning

1. general, backpack, pressure, interval, ring, tree, digital dynamic planning

Memory Search

Steiner Tree

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 Algorithm

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. Dichotomy , three-part method (for biased guidance)

3. divide and conquer,CDQ

4. overloading high-precision operators

5. Offline

6. ST Table

1.13 STL

1. Map

2. Priority_queue

3. Set

4. Bitset

5. Rope

1.14 very See algorithm

1. * Zhu Liu algorithm

2. * chord chart and interval diagram

Red Bold must master, do the more relevant issues, the better, plus * can be temporarily not involved, there is time to learn,NOIP recommended question bank:codevs.cn, provincial election recommended Test Bank:/http www.lydsy.com/JudgeOnline/,

Above the question bank to complete The above-mentioned above the corresponding level of strength.

Oi algorithm summary [outline]