KMP

自己YY的

#include<cstdio> 
#include<cstring>
#include<cmath>
#include<ctime>
#include<iostream>
#include<algorithm>
#include<queue>
#include<set>
#define inf (0x7fffffff)
#define l(a) ((a)<<1)
#define r(a) ((a)<<1|1)
#define b(a) (1<<(a))
#define rep(i,a,b) for(int i=a;i<=(b);i++)
#define clr(a) memset(a,0,sizeof(a))
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
int readint(){
    int t=0,f=1;char c=getchar();
    while(!isdigit(c)){
        if(c=='-') f=-1;
        c=getchar();
    }
    while(isdigit(c)){
        t=(t<<3)+(t<<1)+c-'0';
        c=getchar();
    }
    return t*f;
}
const int maxn=1000009,maxm=1000009;
int n,m,next[maxn];
char A[maxn],B[maxm];
void init(){
    scanf("%s%s",A+1,B+1);
    n=strlen(A+1);m=strlen(B+1);
    next[0]=-1;
    rep(i,2,n){
        for(int t=next[i-1];t;t=next[t]) if(B[i]==B[t+1]){
            next[i]=t+1;break;
        }
        if(!next[i]&&B[i]==B[1]) next[i]=1;
    }
}
void cal(){
    for(int i=1;i<=n-m+1;){
        rep(j,1,m) if(i<=n-m+1){        
                if(A[i+j-1]!=B[j]){
                i+=j-1-next[j-1];//ÒÑÆ¥Åä-next 
                if(j>1) j=next[j-1];
            }else if(j==m){
                printf("%d
",i);
                i+=j-next[j];//ÒÑÆ¥Åä-next 
                break;
            }
        }
    }
    rep(i,1,m){
        printf("%d",next[i]);
        putchar(i==m?'
':' ');
    }
}
int main(){
    init();
    cal();
    return 0;
}