kmp算法

#include<bits/stdc++.h>
using namespace std;

const int N=2e5+10;
vector<int> nxt;string s,t;
int n;

vector<int> getnxt(string s) {
  int n = (int)s.length();
  vector<int> pi(n);
  for (int i = 1; i < n; i++) {
    int j = pi[i - 1];
    while (j > 0 && s[i] != s[j]) j = pi[j - 1];
    if (s[i] == s[j]) j++;
    pi[i] = j;
  }
  return pi;
}

void KMP_Count(string s,string p) {//x为模式串 
	int m=s.size(),n=p.size();
    for(int i = 0, j = 0; i < m; ++i){
        while(j && s[i] != p[j]) j = nxt[j-1];
        if(s[i] == p[j]) j++;
        if(j == n){
        	cout<<i-n+2<<endl;
            j = nxt[j-1];
        }
    }
}
int main(){
	cin>>s>>t;
	nxt=getnxt(t);
	/*for(int i=0;i<m;i++){
		cout<<nxt[i]<<" ";
	}cout<<endl;*/
	KMP_Count(s,t);
	for(int i=0;i<t.size();i++){
		cout<<nxt[i]<<" ";
	}cout<<endl;
	
}