#include<iostream>
using namespace std;
int n, m;
const int N = 1e5+10;
const int M = 1e6+10;
char p[N], s[M];
int ne[N];
int main()
{
cin>>n>>p+1>>m>>s+1;
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;
}
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)
{
cout<<i-n<<" ";
j = ne[j];
}
}
return 0;
}
[KMP算法模板]
最新推荐文章于 2024-08-13 23:31:35 发布