AcWing 831. KMP字符串
原题链接
简单
作者:
Value
,
2022-02-28 16:24:09
,
所有人可见
,
阅读 103
#include <iostream>
using namespace std;
const int N = 1E6 + 10;
char p[N], s[N];
int nx[N];
int main(){
int n; cin >> n >> p + 1;
int m; cin >> m >> s + 1;
for(int i = 2, j = 0; i <= n; i ++ ){
while(j && p[i] != p[j + 1]) j = nx[j];
if(p[i] == p[j + 1]) j ++ ;
nx[i] = j;
}
for(int i = 1, j = 0; i <= m; i ++ ){
while(j && s[i] != p[j + 1]) j = nx[j];
if(s[i] == p[j + 1]) j ++ ;
if(j == n){
cout << i - n << ' ';
j = nx[j];
}
}
return 0;
}