没有合适的资源?快使用搜索试试~ 我知道了~
首页nenu acm 模板
资源详情
资源评论
资源推荐

Northeast Normal
University
ICPC Team
Routine Library
Last Update by Goodness (Nov. 2009)
by WishingBone (ZheJiang University) (Dec. 2002)
1 几何..................................................................................................................................................5
1.1 注意.......................................................................................................................................5
1.2 几何公式...............................................................................................................................6
1.3 多边形...................................................................................................................................8
1.4 多边形切割.........................................................................................................................11
1.5 浮点函数.............................................................................................................................12
1.6 面积.....................................................................................................................................17
1.7 球面.....................................................................................................................................18

1.8 三角形.................................................................................................................................19
1.9 三维几何.............................................................................................................................21
1.10 凸包...................................................................................................................................29
1.11 网格...................................................................................................................................30
1.12 圆.......................................................................................................................................30
1.13 整数函数...........................................................................................................................32
1.14 平面最近最远点对...........................................................................................................35
1.15 凸多边形的直径(多边形最远两点距离)..................................................................37
1.16 多边形的费马点...............................................................................................................38
2 组合................................................................................................................................................39
2.1 组合公式.............................................................................................................................39
2.2 排列组合生成.....................................................................................................................40
2.3 生成 gray 码........................................................................................................................41
2.4 置换(polya).........................................................................................................................42
2.5 字典序全排列.....................................................................................................................43
2.6 字典序组合.........................................................................................................................44
3 结构................................................................................................................................................44
3.1 并查集.................................................................................................................................44
3.2 堆.........................................................................................................................................47
3.3 矩形切割.............................................................................................................................48
3.4 线段树.................................................................................................................................49
3.5 子段和.................................................................................................................................54
3.6 子阵和.................................................................................................................................54
3.7 快速查询子段的最大值和最小值.....................................................................................55
4 数论................................................................................................................................................56
4.1 阶乘最后非 0 位.................................................................................................................56
4.2 模线性方程组.....................................................................................................................57
4.3 素数.....................................................................................................................................58
4.4 欧拉函数.............................................................................................................................61
4.5 斯特林公式.........................................................................................................................62
4.6 容斥原理.............................................................................................................................62
4.7 斐波那契数列.....................................................................................................................63
4.8 分解质因子.........................................................................................................................63
4.9 卡特兰数(Catalan 数)....................................................................................................65
4.10 stein 算法求最大公约数..................................................................................................65
4.11 无平方因数的数...............................................................................................................66
5 数值计算........................................................................................................................................66
5.1 定积分计算(Romberg).......................................................................................................66
5.2 多项式求根(牛顿法)..........................................................................................................68
5.3 周期性方程(追赶法)..........................................................................................................69
6 图论—NP 搜索..............................................................................................................................70
6.1 最大团.................................................................................................................................70
6.2 最大团(n<64)(faster)..........................................................................................................71
7 图论—连通性................................................................................................................................74
2

7.1 无向图关键点(dfs 邻接阵)................................................................................................74
7.2 无向图关键边(dfs 邻接阵)................................................................................................75
7.3 无向图的块(bfs 邻接阵)....................................................................................................75
7.4 无向图连通分支(dfs/bfs 邻接阵)......................................................................................76
7.5 有向图强连通分支(dfs/bfs 邻接阵)..................................................................................77
7.6 有向图最小点基(邻接阵)..................................................................................................79
8 图论—匹配....................................................................................................................................80
8.1 二分图最大匹配(hungary 邻接表)....................................................................................80
8.2 二分图最大匹配(hungary 邻接表形式,邻接阵接口).......................................................80
8.3 二分图最大匹配(hungary 邻接阵)....................................................................................81
8.4 二分图最大匹配(hungary 正向表)....................................................................................82
8.5 二分图最佳匹配(kuhn_munkras 邻接阵).........................................................................82
8.6 一般图匹配(邻接表)..........................................................................................................83
8.7 一般图匹配(邻接表形式,邻接阵接口).............................................................................84
8.8 一般图匹配(邻接阵)..........................................................................................................85
8.9 一般图匹配(正向表)..........................................................................................................86
9 图论—网络流................................................................................................................................87
9.1 最大流(邻接表形式)..........................................................................................................87
9.2 最大流(邻接表形式,邻接阵接口).....................................................................................88
9.3 最大流(邻接阵)..................................................................................................................89
9.4 上下界最大流(邻接表形式)..............................................................................................90
9.5 上下界最大流(邻接阵)......................................................................................................92
9.6 上下界最小流(邻接表形式)..............................................................................................92
9.7 上下界最小流(邻接阵)......................................................................................................94
9.8 最大流无流量(邻接阵)......................................................................................................95
9.9 最小费用最大流(邻接阵)..................................................................................................95
10 图论—应用..................................................................................................................................96
10.1 欧拉回路...........................................................................................................................96
10.2 树的前序表转化...............................................................................................................98
10.3 树的优化算法...................................................................................................................99
10.4 拓扑排序(邻接阵)..........................................................................................................101
10.5 最佳边割集.....................................................................................................................101
10.6 最佳点割集.....................................................................................................................102
10.7 最小边割集.....................................................................................................................104
10.8 最小点割集.....................................................................................................................105
10.9 最小路径覆盖.................................................................................................................106
11 图论—支撑树............................................................................................................................107
11.1 最小生成树(kruskal 邻接表).........................................................................................107
11.2 最小生成树(kruskal 正向表).........................................................................................109
11.3 最小生成树(prim+binary_heap 邻接表)........................................................................110
11.4 最小生成树(prim+binary_heap 正向表)........................................................................111
11.5 最小生成树(prim+mapped_heap 邻接表).....................................................................112
11.6 最小生成树(prim+mapped_heap 正向表).....................................................................113
11.7 最小生成树(prim 邻接阵)..............................................................................................115
3

11.8 最小树形图(邻接阵)......................................................................................................115
12 图论—最短路径........................................................................................................................117
12.1 最短路径(单源 bellman_ford 邻接阵)...........................................................................117
12.2 最短路径(单源 dijkstra+bfs 邻接表).............................................................................118
12.3 最短路径(单源 dijkstra+bfs 正向表).............................................................................118
12.4 最短路径(单源 dijkstra+binary_heap 邻接表)..............................................................119
12.5 最短路径(单源 dijkstra+binary_heap 正向表)..............................................................120
12.6 最短路径(单源 dijkstra+mapped_heap 邻接表)............................................................121
12.7 最短路径(单源 dijkstra+mapped_heap 正向表)............................................................122
12.8 最短路径(单源 dijkstra 邻接阵)....................................................................................123
12.9 最短路径(单源 spfa 邻接阵)..........................................................................................124
12.10 最短路径(单源 spfa 邻接表)........................................................................................125
12.11 最短路径(多源 floyd_warshall 邻接阵)......................................................................126
13 应用............................................................................................................................................127
13.1 Joseph 问题.....................................................................................................................127
13.2 N 皇后构造解.................................................................................................................127
13.3 布尔母函数.....................................................................................................................128
13.4 第 k 元素.........................................................................................................................129
13.5 幻方构造.........................................................................................................................129
13.6 模式匹配(kmp)...............................................................................................................131
13.7 逆序对数.........................................................................................................................132
13.8 字符串最小表示.............................................................................................................132
13.9 最长公共单调子序列.....................................................................................................133
13.10 最长单调子序列...........................................................................................................135
13.11 最大子串匹配...............................................................................................................136
13.12 最大子段和...................................................................................................................137
13.13 最大子阵和...................................................................................................................137
13.14 最大 m 段子段和..........................................................................................................138
13.15 二分查找.......................................................................................................................139
13.16 已知树的先序中序求后序...........................................................................................139
13.17 多串匹配(AC 自动机)............................................................................................140
14、高精度运算专题.....................................................................................................................144
14.1 专题函数说明.................................................................................................................144
14.2 高精度数比较.................................................................................................................145
14.3 高精度数加法.................................................................................................................146
14.4 高精度数减法.................................................................................................................146
14.5 高精度乘 10....................................................................................................................147
14.6 高精度乘单精度.............................................................................................................148
14.7 高精度乘高精度.............................................................................................................148
14.8 高精度除单精度.............................................................................................................149
14.9 高精度除高精度.............................................................................................................150
15、其它.........................................................................................................................................151
15.1 大数(只能处理正数)......................................................................................................151
15.2 分数.................................................................................................................................156
4

15.3 矩阵.................................................................................................................................158
15.4 矩阵快速幂.....................................................................................................................160
15.5 线性方程组.....................................................................................................................163
15.6 线性相关.........................................................................................................................165
15.7 日期.................................................................................................................................166
15.8 语言方面的总结.............................................................................................................167
15.9 一些小技巧.....................................................................................................................167
1 几何
1.1 注意
1. 注意舍入方式(0.5 的舍入方向);防止输出-0.
2. 几何题注意多测试不对称数据.
3. 整数几何注意 xmult 和 dmult 是否会出界;
5
剩余63页未读,继续阅读





安全验证
文档复制为VIP权益,开通VIP直接复制

评论0