AcWing 831. KMP字符串
原题链接
简单
作者:
stc
,
2024-03-04 12:19:42
,
所有人可见
,
阅读 17
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int M = 1e5+10, N = 1e6+10;
int m,n;
char p[M],s[N];
int ne[M];
int main()
{
cin >> m >> p+1 >> n >> s+1;
// next[]
ne[1] = 0;
for(int i=2,j=0;i<=m;i++){
while(j && p[i]!=p[j+1]) j = ne[j];
if(p[i] == p[j+1]) j ++;
ne[i] = j;
}
// kmp
for(int i=1,j=0;i<=n;i++){
while(j && s[i]!=p[j+1]) j = ne[j];
if(s[i] == p[j+1]) j ++;
if(j == m){
cout << i - m << ' ';
j = ne[j];
}
}
return 0;
}