【索引】学习笔记目录
NCC79601
2019-05-27 13:36:19
## 图论
| 内容 | 链接 |
| :----------- | :----------- |
|最短路|[shortest-path](https://ncc79601.blog.luogu.org/shortest-path)|
|$k$短路|[kth-shortest-path](https://ncc79601.blog.luogu.org/heuristic-search)|
| $\text{LCA}$ | [lowest-common-ancestor](https://ncc79601.blog.luogu.org/lowest-common-ancestor) |
| 欧拉回路 | [Euler-circuit](https://ncc79601.blog.luogu.org/Euler-circuit) |
| 树的直径 | [diameter-of-tree](https://ncc79601.blog.luogu.org/diameter-of-tree) |
|桥(删边最短路)|[bridge](https://ncc79601.blog.luogu.org/bridge)|
|$\text{Tarjan}$|[tarjan](https://ncc79601.blog.luogu.org/tarjan)|
|||
|$\cdots$|$and\ more\cdots$|
---
## 动态规划
|内容|链接|
|:-|:-|
|路径压缩$\text{dp}$|[shorten-path-dp](https://ncc79601.blog.luogu.org/shorten-path-dp)|
|齐线法|[rectangle-dp](https://ncc79601.blog.luogu.org/rectangle-dp)|
|四维dp|[4d-dp](https://ncc79601.blog.luogu.org/4d-dp)|
|最长单调子序列|[monotonous-sequence](https://ncc79601.blog.luogu.org/monotonous-sequence)|
|有向无环图$\text{dp}$|[DAG-dp](https://ncc79601.blog.luogu.org/DAG-dp)|
|状压$\text{dp}$|[state-compression](https://ncc79601.blog.luogu.org/state-compression)|
|区间$\text{dp}$|[interval-dp](https://ncc79601.blog.luogu.org/interval-dp)|
|数位$\text{dp}$|[digit-dp](https://ncc79601.blog.luogu.org/digit-dp)|
|斜率优化|[slope](https://ncc79601.blog.luogu.org/slope)|
|基环树$\text{dp}$|[loop-tree-dp](https://ncc79601.blog.luogu.org/loop-tree-dp)|
|||
|$\cdots$|$and\ more\cdots$|
---
## 数据结构
|内容|链接|
|:-|:-|
|$\text{STL}$相关|[STL-operation](https://ncc79601.blog.luogu.org/STL-operation)|
|手写堆|[handwritten-heap](https://ncc79601.blog.luogu.org/handwritten-heap)|
|ST 表|[st-table](https://ncc79601.blog.luogu.org/st-table)|
|树状数组|[binary-index-tree](https://ncc79601.blog.luogu.org/binary-index-tree)|
|线段树|[segment-tree](https://ncc79601.blog.luogu.org/segment-tree)|
|扫描线|[scan-line](https://ncc79601.blog.luogu.org/scan-line)|
|树链剖分|[tree-chain-split](https://ncc79601.blog.luogu.org/tree-chain-split)|
|平衡树:$\text{Treap}$|[Treap-balanced-tree](https://ncc79601.blog.luogu.org/Treap-balanced-tree)|
|平衡树:替罪羊树|[scapegoat](https://ncc79601.blog.luogu.org/scapegoat)|
|平衡树:替罪羊树(封装)|[packed-scapegoat](https://ncc79601.blog.luogu.org/packed-scapegoat)|
|平衡树:fhq Treap|[fhq-treap](https://ncc79601.blog.luogu.org/fhq-treap)|
|左偏树 / 可并堆|[leftist-tree](https://ncc79601.blog.luogu.org/leftist-tree)|
|$\text{Dynamic\ Rankings}$|[dynamic-rankings](https://ncc79601.blog.luogu.org/dynamic-rankings)|
|||
|$\cdots$|$and\ more\cdots$|
---
## 数论
|内容|链接|
|:--|:--|
|$\text{exgcd}$|[exgcd](https://ncc79601.blog.luogu.org/exgcd)|
|逆元|[inverse](https://ncc79601.blog.luogu.org/inverse)|
|组合数递推性质|[properties-of-combination-numbers](https://ncc79601.blog.luogu.org/properties-of-combination-numbers)|
|欧拉函数|[euler-function](https://ncc79601.blog.luogu.org/euler-function)|
|中国剩余定理|[chinese-remainder-theorem](https://ncc79601.blog.luogu.org/chinese-remainder-theorem)|
|卢卡斯定理|[lucas](https://ncc79601.blog.luogu.org/lucas)|
|||
|$\cdots$|$and\ more\cdots$|
---
## 基础算法
|内容|链接|
|:-|:-|
|启发式搜索|[heuristic-search](https://ncc79601.blog.luogu.org/heuristic-search)|
---
## 其他
|内容|链接|
|:-|:-|
|逆熵法|[inverse-entropy](https://ncc79601.blog.luogu.org/inverse-entropy)|
|cdq 分治|[cdq-divide](https://ncc79601.blog.luogu.org/cdq-divide)|