![](https://img-blog.csdnimg.cn/20201014180756916.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
poj
hzt_Owen
这个作者很懒,什么都没留下…
展开
-
【poj 3261】后缀数组
先求后缀数组,再二分答案。#include #include #include #include #include #include #define Rep(i, x, y) for (int i = x; i <= y; i ++)#define RepE(i, x) for (int i = pos[x]; i; i = g[i].nex)#define Dwn(i, x,原创 2015-03-05 10:23:37 · 379 阅读 · 0 评论 -
【poj 1741】点分治
路径长小于k的个数,裸题。#include #include #include #include #include #include #define Rep(i, x, y) for (int i = x; i <= y; i ++)#define RepE(i, x) for (int i = pos[x]; i; i = g[i].nex)#define Dwn(i, x, y原创 2015-02-17 12:12:46 · 338 阅读 · 0 评论 -
【poj 1743】后缀数组
不可重叠最长重复子串。二分答案后将height数组分段,看每段中sa最大减最小是否满足。#include #include #include #include #include #include #define Rep(i, x, y) for (int i = x; i <= y; i ++)#define RepE(i, x) for (int i = pos[x]; i原创 2015-03-06 10:54:01 · 330 阅读 · 0 评论 -
【poj1811】Miller_Rabin and Pollard_rho
Miller_Rabin算法 O(logn)即可判断素数。由费马小定理得知 a ^ (n-1) = 1 (mod n), 所以可以随机a,然后判断。判断方法:设n - 1 = (2 ^ r) * d (d % 2 == 1)。若a ^ d == 1 (mod n) 或存在 0 Pollard_rho还不太明白……#include #include #include #i原创 2014-12-28 10:57:43 · 457 阅读 · 0 评论