题目
题目链接:https://www.luogu.com.cn/problem/P3375
代码
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<cctype>
#include<ctime>
#include<iostream>
#include<string>
#include<map>
#include<queue>
#include<stack>
#include<set>
#include<vector>
#include<iomanip>
#include<list>
#include<bitset>
#include<sstream>
#include<fstream>
#include<complex>
#include<algorithm>
#if __cplusplus >= 201103L
#include <unordered_map>
#include <unordered_set>
#endif
#define ll long long
using namespace std;
const int INF = 0x3f3f3f3f;
int kmp[1000010];
char a[1000010],b[1000010];
int main(){
ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
cin>>a+1;
cin>>b+1;
int j=0;
int la=strlen(a+1);
int lb=strlen(b+1);
for(int i=2;i<=lb;i++){
while(j&&b[i]!=b[j+1]) j=kmp[j];
if(b[i]==b[j+1]) j++;
kmp[i]=j;
}
j=0;
for(int i=1;i<=la;i++){
while(j&&a[i]!=b[j+1]) j=kmp[j];
if(b[j+1]==a[i]) j++;
if(j==lb) cout<<i-lb+1<<endl;
}
for(int i=1;i<=lb;i++) cout<<kmp[i]<<" "[i==lb];
return 0;
}