This switched https://blog.csdn.net/myjs999/article/details/82903220
Optimization Strategy
Binary enumeration
offline
back in time
the double pointer / sliding window / scale taken
monotonic optimization
greedy
partition
doubling
Dynamic Programming
Dynamic Programming Type
Simple DP
interval DP
tree DP
digital DP
backpack (01 | completely | multiple - Monotone queue optimization) *
-shaped pressure DP
desired DP
other DP
Dynamic Programming optimization
Monotone queue Optimization
Matrix Fast Power
mathematics
Number Theory
Fast power
extended Euclidean
Fermat's little theorem
inverse
Chinese remainder theorem
linear sieve
combination
Lucas Theorem
basis of inclusion and exclusion
(Cattleya number)
Linear Algebra
Matrix multiplication
Gaussian elimination
data structure
& Ideological foundation
STL
simple partition
prefix and
differential
-D prefix and / differential
monotonous queue
monotonous stack
disjoint-set
weighted disjoint-set
discrete
Tree structure
ST Table
Fenwick tree
two-dimensional array of tree
tree line
leftist tree *
Dynamic prescription segment tree
marking tree perpetuate
range segment tree
the Trie
Chairman of the tree
(balanced tree)
Order tree structure
dfs Sequence
tree chain split
the LCA (multiplication / ST Table / tarjan)
Graph Theory
Traversing Graph
Eulerian paths Eulerian
tarjan seeking the SCC / the BCC
2-the SAT
Shortest
Optimization stack the Dijkstra: \ (O ((n-m +) logN) \)
the SPFA: \ (O (Mn) \)
the Floyd
shortest path tree / DAG shortest
differential restraint system
split point
by Optimized FIG.
Minimum spanning tree
The Kruskal: \ (O (mlogn) \)
Prim: \ (O (^ n-2) \)
Minimum Spanning Tree Bottleneck
Small views spanning tree ( \ (O (mlogn) \) or \ (O (^ n-2) \) )
String
Hash
KMP
AC automatic machine basis
Trie map *