KMP 算法模板（背）

#include<iostream>
using namespace std;
const int N = 100010,M = 10010;
char p[M],q[N];

int m,n;
int ne[N];
int main(){
    cin>>n>>p + 1>> m>> q + 1;
    for(int i = 2,j = 0; i <= n;i++){
            while(j && p[i] != p[j+1])j = ne[j];//找到前面的最大前綴和後綴相等的那個index
            if(p[i] == p[j + 1])j ++;
            ne[i] = j;
    }
    for(int i = 1,j = 0;i <= m;i++){
        while(j && q[i] != p[j+1])j = ne[j];
        if(q[i] == p[j + 1])j++;
        if(j == n){
            cout<< i -j <<" ";
            j = ne[j];
        }
    }
    
}