米夏

一个简单的hash #include #include using namespace std; unsigned ans=0; unsigned BKDRHash(char *str) { unsigned seed = 131; // 31 131 1313 13131 131313 etc.. unsigned hash = 0; while (*str)has

ac自动机，模板题 #include #include using namespace std; const int MAXN = 500000+5; const int LEN = 50+5; const int SIGMA = 26; char a[LEN],b[MAXN*2]; int trie[MAXN][SIGMA],q[MAXN],f[MAXN],val[MAXN],vis[MA

//HDU2222 #include <bits/stdc++.h> using namespace std; const int MAXN = 500000 + 5; const int SIGMA = CHAR_MAX; int f[MAXN], last[MAXN]; struct trie { int ch[MAXN][SIGMA]; int val[MA...

//后缀数组，尚有bug #include <iostream> #include <cstdio> #include <cstring> #include <algorithm> //#define rep(i, a, b) for(int i=a;i<b;i++) using namespace std; const int MAXN ...