AcWing 831. KMP字符串
原题链接
简单
作者:
dsyami
,
2021-05-12 11:01:21
,
所有人可见
,
阅读 166
#include <iostream>
using namespace std;
const int N = 1e5 + 10, M = 1e6 + 10;
int ne[N], n, m;
char s[M], p[N];
int main()
{
cin >> n >> p + 1 >> m >> s + 1;
//求next数组
for(int i = 2, j = 0; i <= n; 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 <= m; i ++ )
{
while(j && s[i] != p[j + 1]) j = ne[j];
if(s[i] == p[j + 1]) j ++ ;
if(j == n)
{
printf("%d ", i - n);
j = ne[j];
}
}
return 0;
}