【KMP模板】简单写个KMP~

#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;

char a[1000010],b[10010];
int nextt[10010];

int main()
{
    scanf("%s%s",a+1,b+1);
    int la=strlen(a+1);
    int lb=strlen(b+1);
    int j=0;
    for(int i=2;i<=lb;i++)
    {
        while(b[j+1]!=b[i]&&j) j=nextt[j];
        j+=(b[j+1]==b[i]);
        nextt[i]=j;
    }
    
    j=0;
    for(int i=1;i<=la;i++){
        while(j&&a[i]!=b[j+1]) j=nextt[j];
        j+=(a[i]==b[j+1]);
        if(j==lb) printf("%d\n",i-lb+1);    
    }
    for(int i=1;i<=lb;++i)
        printf("%d ",nextt[i]);
    return 0;
}