AcWing 831. KMP字符串
原题链接
简单
作者:
ღ她没说晚安
,
2021-08-20 10:39:23
,
所有人可见
,
阅读 158
字符串哈希解法
#include<bits/stdc++.h>
using namespace std;
const int N = 1000010, P = 131;
ULL hs[N], p[N], hp[N];
typedef unsigned long long ULL;
char s[N], pt[N];
ULL get(int l, int r)
{
return hs[r] - hs[l-1] * p[r-l+1];
}
int main()
{
int n, m;
cin >> n >> pt+1 >> m >> s+1;
p[0] = 1;
for(int i=1; i<=m; i++) {
p[i] = p[i-1] * P;
hs[i] = hs[i-1] * P + s[i];
}
for(int i=1; i<=n; i++) hp[i] = hp[i-1] * P + pt[i];
int r = n;
while(r <= m) {
if(hp[n] == get(r-n+1, r)) {
cout << r-n << ' ';
}
r++;
}
return 0;
}