AcWing 831. KMP字符串
原题链接
简单
作者:
Anoxia_3
,
2020-02-20 12:22:19
,
所有人可见
,
阅读 1046
#include <iostream>
using namespace std;
const int N = 1000010;
char s[N] , p[N];
int ne[N];
int main()
{
int n , m;
cin >> n >> p + 1 >> m >> s + 1;
for(int i = 2 , j = 0 ;i <= n ;i++)
{
while(j && p[j + 1] != p[i]) j = ne[j];
if(p[j + 1] == p[i]) j++;
ne[i] = j;
}
for(int i = 1 , j = 0 ; i <= m ; i++)
{
while(j && p[j + 1] != s[i]) j = ne[j];
if(p[j + 1] == s[i]) j++;
if(j == n)
{
cout << i - j << ' ' ;
j = ne[j];
}
}
}