1
目录
目录 .............................................. 1
Graph 图论 ........................................ 3
|
DAG的深度优先搜索标记..............................................3
|
无向图找桥 .....................................................................3
|
无向图连通度(割) ........................................................3
|
最大团问题
DP
+
DFS .................................................3
|
欧拉路径O(E)................................................................3
|
D
IJKSTRA
数组实现O(N^2) .......................................3
|
D
IJKSTRA
O(E
*
LOG
E).............................................4
|
B
ELLMAN
F
ORD
单源最短路O(VE)...................................4
|
SPFA(S
HORTEST
P
ATH
F
ASTER
A
LGORITHM
) ..............4
|
第K短路(D
IJKSTRA
)...................................................5
|
第K短路(A*) ..............................................................5
|
P
RIM
求MST .....................................................................6
|
次小生成树O(V^2).......................................................6
|
最小生成森林问题(
K
颗树)O(
MLOGM
). .......................6
|
有向图最小树形图 .........................................................6
|
M
INIMAL
S
TEINER
T
REE
................................................6
|
T
ARJAN
强连通分量.........................................................7
|
弦图判断 .........................................................................7
|
弦图的
PERFECT ELIMINATION
点排列 ............................7
|
稳定婚姻问题
O(
N
^2)..................................................7
|
拓扑排序 .........................................................................8
|
无向图连通分支(
DFS
/
BFS
邻接阵) ..............................8
|
有向图强连通分支(
DFS
/
BFS
邻接阵)O(
N
^2) ............8
|
有向图最小点基(邻接阵)O(
N
^2)...............................9
|
F
LOYD
求最小环...............................................................9
|
2-
SAT
问题 ......................................................................9
Network 网络流 ................................... 11
|
二分图匹配(匈牙利算法DFS实现) ........................ 11
|
二分图匹配(匈牙利算法BFS实现) ........................ 11
|
二分图匹配(H
OPCROFT
-C
ARP
的算法)...................11
|
二分图最佳匹配(
KUHN MUNKRAS
算法O(
M
*
M
*
N
))..11
|
无向图最小割
O(N^3) ...............................................12
|
有上下界的最小(最大)流 ..........................................12
|
D
INIC
最大流
O(V^2
*
E)........................................12
|
HLPP最大流
O(V^3) .................................................13
|
最小费用流
O(V
*
E
*
F
) .......................................13
|
最小费用流
O(V^2
*
F
) ...........................................14
|
最佳边割集 ...................................................................15
|
最佳点割集 ...................................................................15
|
最小边割集 ...................................................................15
|
最小点割集(点连通度) ...........................................16
|
最小路径覆盖O(
N
^3) .................................................16
|
最小点集覆盖 ...............................................................16
Structure 数据结构 ............................... 17
|
求某天是星期几 ...........................................................17
|
左偏树
合并复杂度O(
LOG
N) ....................................17
|
树状数组 .......................................................................17
|
二维树状数组 ...............................................................17
|
T
RIE
树(
K
叉)................................................................17
|
T
RIE
树(左儿子又兄弟)..............................................18
|
后缀数组
O(N
*
LOG
N)............................................18
|
后缀数组
O(N) ............................................................18
|
RMQ离线算法
O(N*
LOG
N)+O(1)..............................19
|
RMQ(R
ANGE
M
INIMUM
/M
AXIMUM
Q
UERY
)-
ST
算法
(O(
NLOGN
+
Q)).............................................................19
|
RMQ离线算法
O(N*
LOG
N)+O(1)求解LCA...............19
|
LCA离线算法
O(E)+O(1).........................................20
|
带权值的并查集 ...........................................................20
| 快速排序 .......................................................................20
|
2 台机器工作调度........................................................20
|
比较高效的大数 ...........................................................20
|
普通的大数运算 ...........................................................21
|
最长公共递增子序列
O(
N
^2)....................................22
|
0-1 分数规划...............................................................22
|
最长有序子序列(递增/递减/非递增/非递减) ....22
|
最长公共子序列 ...........................................................23
|
最少找硬币问题(贪心策略-深搜实现).................23
|
棋盘分割 .......................................................................23
|
汉诺塔 ...........................................................................23
|
STL中的
PRIORITY
_
QUEUE
............................................24
|
堆栈 ...............................................................................24
| 区间最大频率 ...............................................................24
|
取第
K
个元素 .................................................................25
|
归并排序求逆序数 .......................................................25
|
逆序数推排列数 ...........................................................25
|
二分查找 .......................................................................25
|
二分查找(大于等于
V
的第一个值) .........................25
|
所有数位相加 ...............................................................25
Number 数论 ...................................... 26