| Flag | 标题 | 通过 | 提交 | 难度 |
|---|
基础算法
[模拟] [排序] [贪心] [分治] [递推] [递归] [二分答案] [逆序对] [中位数] [离散化] [倍增法] [构造法] [其它算法] [三分答案] [前缀和] [矩阵前缀和] [爬山算法*] [模拟退火*]
数学问题
[数学推理] [公约数与公倍数] [基础素数问题] [分解质因子] [欧几里得] [扩展欧几里得] [快速幂] [模运算] [排列组合] [进制转换] [高精度] [同余方程] [高斯消元] [容斥原理] [鸽巢原理] [中国剩余定理*] [欧拉函数*] [Pólya计数定理*] [矩阵快速幂] [莫比乌斯反演*] [矩阵乘法] [费马小定理*] [Miller-Rabin*] [FTT*] [NTT*] [斯特林数*] [BSGS*] [Pollard's Rho*] [矩阵树定理*] [线性筛法*] [杜教筛*] [Lucas 定理*] [辛普森积分*] [拉格朗日插值*] [FWT算法*] [二项式*] [线性基*] [单纯形算法*]
字符串
[一般字符串处理] [模式匹配(KMP)] [扩展KMP] [字典树(Trie树)] [最长公共字串] [最长回文子串-Manacher算法] [后缀数组*] [AC自动机*] [后缀自动机*] [字符串哈希] [回文树*] [回文自动机*]
搜索算法
[深度优先搜索(DFS/回溯法)] [广度优先搜索(BFS)] [双向搜索] [启发式搜索(A*)] [搜索剪枝优化] [哈希优化BFS] [迭代加深] [Dancing Links] [折半搜索] [DLX算法*]
动态规划(DP)
[普通线性DP] [区间型DP] [环形DP] [坐标型DP] [双路DP] [树型DP] [背包问题] [最长公共子序列(LCS)] [最长不下降系列] [最大子段和] [记忆化搜索] [状态压缩DP] [滚动数组降维] [状态决策优化] [单调性优化] [斜率优化*] [数位DP] [四边形不等式优化*] [插头DP*] [概率期望DP] [轮廓线DP*]
数据结构
[栈] [队列] [链表] [哈希表] [二叉堆] [并查集] [树的遍历] [普通树转二叉树] [树状数组] [最近公共祖先(LCA)] [区间最值查询问题(RMQ)*] [线段树*] [可持久化线段树*] [二叉搜索树(BST)*] [平衡二叉搜索树(SBT)*] [Treap*] [伸展树*] [树链剖分*] [动态树*] [主席树*] [左偏树*] [树的直径] [树的重心] [虚树*] [LCT*] [可持久化Trie树*] [替罪羊树*] [树上倍增] [树套树*] [整体二分*] [启发式合并*] [动态树分治*] [持久化并查集*] [动态点分治*] [莫队算法] [可并堆*] [ZKW线段树*] [KDtree*] [CDQ分治*] [树上莫队*]
图论
[图的遍历] [最短路径(SPFA等)] [环或负权边的最短路] [第K短路] [差分约束系统] [最小生成树] [次小生成树] [最大生成树] [拓扑排序] [联通性问题(Tarjian等)] [网络流-最大流*] [网络流-费用流*] [网络流-有上下界的网络流*] [匹配-最大匹配*] [匹配-最优匹配*] [2-SAT问题*] [欧拉回路] [最小树形图*] [次短路径] [仙人掌*] [斯坦纳树*] [支配树*] [ZKW费用流*] [完美消除序列*] [带花树*] [朱刘算法*]
计算几何*
[点、直线关系] [简单多边形] [凸包] [半平面交] [最近点对] [面积计算问题] [旋转卡壳] [多圆面积并/交] [最小圆覆盖*] [三角剖分*] [动态凸包*] [极角排序*] [直线求交*] [pick定理*] [凸包二分*] [最小乘积生成树*] [Voroni图*]
游戏策略*
[博弈树] [Nim & Anti-Nim游戏] [Sg函数]
历届NOIP
历届APIO
历届省选
[四川省选] [浙江省选] [湖南省选] [重庆省选] [其它省选]
历届NOI
历届冬令营＋CTSC
在线测试
[POJ] [USACO] [Ural] [HDU] [SPOJ] [ZOJ]
网上比赛
