This is the content that I hope to understand and master in the near future, updated from time to time ( blue means that I have basically mastered it )
- Cattleya Number
- FFT & FWT & NTT
- Domination tree
- dp
- Rely on backpack
- Slope optimization
- Computational geometry
- Simpson Points
- Green formula
Simply record the new knowledge learned this year (if it is very low, please don’t spray)
-
7-10
- Digital dp
- Dictionary tree stores binary numbers
-
7-11
- Maximum all 1 matrix
-
7-12
- Tolerant preprocessing all sub-matrix information
f[i][j]=f[i-1][j]+f[i][j-1]-f[i-1][j-1]+a[i][j]
- Tolerant preprocessing all sub-matrix information
-
7-13
- Matrix multiplication
-
7-14
- C++ STL (usually, everything except sort is basically handwritten. Some complicated ones are very troublesome. Learn STL again, such as map, priority queue, etc.)
-
7-17
- (Search optimization)
- A*
- Two-way bfs
- Iteratively deepen bfs
-
7-18
- AC automata
- manacher
- Reconstruction map
-
7-27
- nlog 2 k \ nlog_2k n l o g2k method to find LIS (longest ascending subsequence)
-
8-22
- Dp on AC automata
-
8-23
- Chairman tree (persistent line segment tree)
-
8-25
- Block
-
9-23
- Two types of Stirling numbers
-
10-7
- Card often skills
- Same color triangle
- Mo team
-
10-16
- Linear sieve of product function
-
10-23
- LCT (Dynamic Tree)
-
10-27
- Matrix fast power
- Find a certain term in the Fibonacci sequence
- bsgs algorithm (solve A^x=B (mod C))
- Matrix fast power
-
10-29
- Overloaded operator
- Constructor
-
10-31
- Joseph Problem (O(nm)->O(n)->O(m))
-
11-1
- Undirected graph isomorphism
-
11-6
- A topical mapping routine (http://blog.csdn.net/jackypigpig/article/details/78461000)
-
11-7
- Rely on backpack
- Depend on the backpack on the tree (NM approach)
- Rely on backpack
-
11-9
- Scan line
- Mo team algorithm
- Tree block
-
11-17
- Dinic&EK
-
11-24
- Some simple computational geometry
-
11-27
- splay
-
12-14
- FWT
-
12-26
- Probability correlation