Paige's Blog

这道确实太简单了，复习一下。#include #include #include #include #include #include #include using namespace std; #define N 1100 #define M 5000 int p[N]; int find(int x){ return x==p[x]?x:find(p[x]);

注意输入数据不止有数据。没什么特别的地方，用来熟悉算法。#include #include #include #include #include #includeusing namespace std;#define N 210#define M 10100bool vis[510];char str[N],page[M];int total,n_ans;int a

http://acm.hdu.edu.cn/showproblem.php?pid=2222#include #include #include #include #includeusing namespace std;#define N 500010#define MAXN 1000010char str[MAXN],keyword[51];int head,tai

这两道题一模一样，代码都通用....................带权并查集和并查集偏移向量一回事儿#include #include #include #include #include #include #include using namespace std;#define N 200050int p[N],sum[N];int find(int x){

最基础的单点更新#include #include #include #include #include #include #include #define MAXN 100000+10#define L(i) i<<1#define R(i) i<<1|1using namespace std;struct node{ int l,r; i

http://blog.csdn.net/liang5630/article/details/7917702http://www.cnblogs.com/andyzhang2068/archive/2011/07/09/2101892.html

题意：求字符串中所有前缀跟其相同的子串的总个数？ 同样是KMP的应用dp[i]代表的是从 最长前缀到最小前缀的匹配数#include #include #include #include #include using namespace std;#define N 200010char s[N];int dp[N];int nextval[N],len;void g

题意：一个字符串，要求只能在字符串左右两侧添加的字符，将字符串变成最少循环2次的周期串。题意：问：需要添加多少个字符KMP：next数组的应用#include#include#include#includeusing namespace std;#define N 100010char s[N];int nextval[N];int len;void getn

http://acm.hdu.edu.cn/showproblem.php?pid=1711题意：从s串中如果能找出p串，则输出p串在s串的位置（两个串下标都从1开始）KMP模板题。。。。#include #include #include #include #include #include #include using namespace std;int