| Floyd | https://www.luogu.com.cn/problem/B3647 | | n^3或n^2logn复杂度计算全源最短路 |
| 质数筛 | https://www.luogu.com.cn/problem/P5736 | | 埃氏筛欧拉筛 |
| 求第 k 小的数 | https://www.luogu.com.cn/problem/P1923 | | 分治快速排序思想 |
| 队列 | https://www.luogu.com.cn/problem/B3616 | | STL queue |
| 最长上升子序列 | https://www.luogu.com.cn/problem/B3637 | | 动态规划 |
| 单源最短路径（弱化版） | https://www.luogu.com.cn/problem/P3371 | | 图论基础算法dijkstra |
| 单源最短路径（标准版） | https://www.luogu.com.cn/problem/P4779 | | 图论基础算法dijkstra |
| 堆 | https://www.luogu.com.cn/problem/P3378 | | STL priority_queue |
| 最近公共祖先（LCA） | https://www.luogu.com.cn/problem/P3379 | | nlogn倍增 |
| 【模板】ST 表 && RMQ 问题 | https://www.luogu.com.cn/problem/P3865 | | O(1)查询倍增 |
| 单调栈 | https://www.luogu.com.cn/problem/P5788 | | 单调性 |
| 传递闭包 | https://www.luogu.com.cn/problem/B3611 | | 传递闭包Floyd |
| 最长公共子序列 | https://www.luogu.com.cn/problem/P1439 | | 动态规划最长上升子序列 |
| 石子合并 | https://www.luogu.com.cn/problem/P1880 | | 区间动态规划 |
| Nim 游戏 | https://www.luogu.com.cn/problem/P2197 | | 博弈论 |
| 强连通分量 | https://www.luogu.com.cn/problem/B3609 | | tarjan |
| 缩点 | https://www.luogu.com.cn/problem/P3387 | | tarjan强连通分量 |
| 割点（割顶） | https://www.luogu.com.cn/problem/P3388 | | tarjan强连通分量 |
| 线段树 1 | https://www.luogu.com.cn/problem/P3372 | | 线段树 |
| 线段树 2 | https://www.luogu.com.cn/problem/P3373 | | 线段树lazy-tag |
| 树状数组 1 | https://www.luogu.com.cn/problem/P3374 | | 树状数组 |
| 树状数组 2 | https://www.luogu.com.cn/problem/P3368 | | 树状数组 |
| 差分约束 | https://www.luogu.com.cn/problem/P5960 | | dijkstra图论 |
| 网络最大流 | https://www.luogu.com.cn/problem/P3376 | | 网络最大流图论 |
| 左偏树/可并堆 | https://www.luogu.com.cn/problem/P3377 | | 左偏树可并堆 |