| conclusion (16) | 树链剖分 (3) | 高精度 (2) | 悬线法 (1) |
| maths (14) | ST (2) | 二分 (2) | 网络流 (1) |
| dp (13) | spfa (2) | 并查集 (2) | 缩点 (1) |
| luogu (12) | set (2) | write (1) | 双向BFS (1) |
| ssoj (9) | rmq (2) | stack (1) | 双连通分量 (1) |
| graph (8) | number theory (2) | scanf (1) | 数位DP (1) |
| analog (8) | lowbit (2) | read optimize (1) | 树分治 (1) |
| string (7) | LCS (2) | read (1) | 三分 (1) |
| review (6) | lcm (2) | random (1) | 匹配 (1) |
| knapsack (5) | lca (2) | operator (1) | 逆序对 (1) |
| search (4) | internal (2) | operate (1) | 模拟退火 (1) |
| 最短路 (4) | heap (2) | mmap (1) | 记忆化搜索 (1) |
| 线段树 (4) | DFS (2) | mistake (1) | 归并排序 (1) |
| 单调队列 (4) | BFS (2) | map (1) | 分治 (1) |
| STL (3) | A* (2) | LIS (1) | 分块 (1) |
| repost (3) | 玄学 (2) | K短路 (1) | 费用流 (1) |
| noip (3) | 拓扑排序 (2) | hash (1) | 对拍 (1) |
| MST (3) | 树形DP (2) | fread (1) | 迭代加深 (1) |
| gcd (3) | 筛法 (2) | exgcd (1) | 点分治 (1) |
| combination (3) | 区间dp (2) | deque (1) | 单调栈 (1) |
| 状压DP (3) | 强连通分量 (2) | debug (1) | 次小生成树 (1) |
| 位运算 (3) | 快速幂 (2) | contest (1) | 差分约束 (1) |
| 贪心 (3) | 矩阵乘法 (2) | C++ (1) | 2-SAT (1) |
| 树状数组 (3) | 割点/桥 (2) | 最大流 (1) |
OIer | Student
浙公网安备 33010602011771号