0.set,map的lower_bound upper_bound
1.最短路(dijkstra 优先队列优化)
2.最小生成树(并查集)
3.hash表
4.字符串hash
5.kmp
6.线段树
7.bellman-ford
8.线性筛
9.动态规划(树形dp,常见dp)
10.树状数组
11.可并堆
12.莫队(分块)
13.二分猜答案
https://blog.csdn.net/m0_46521785/article/details/107971893

Last modification:December 19th, 2020 at 10:38 am