洛谷日刷

#include <cstring>
#define maxN 1000001
#define maxM 2001
#define inf 247493646
int n,m;
int next[maxN];
char A[maxN],B[maxN];
int (){
    scanf("%s",A);
    scanf("%s",B);
    n = strlen(A);
    m = strlen(B);
    next[0] = -1;
    for (int i = 1;i<m;i++){
        int j = next[i-1];
        while((B[j+1]!=B[i])&&(j>=0))
            j = next[j];
        if(B[j+1] == B[i])
            next[i] = j+1;
        else
            next[i] = -1;
    }
    int i = 0,j = 0;
    while(i<n){
        if(A[i] == B[j]){
            i++;j++;
            if(j == m){
                printf("%dn",i-m+1);
                j = next[j-1]+1;
            }
        }
        else{
            if(j == 0)
                i++;
            else
                j = next[j-1]+1;
        }
    }
    for (int i = 0;i<m;i++)
        printf("%d ",next[i]+1);
    printf("n");
    return 0;
}