[模板]洛谷T3375 KMP字符串匹配

这东西。。。算是半囫囵吞枣的理解了。。。总之板子背过就好了嘛QwQ~

#include<cstdio>
#include<iostream>
#include<cstring>
#include<cmath>
#include<ctime>
#include<cstdlib>

#include<string>
#include<stack>
#include<queue>
#include<vector>
#include<algorithm>
#include<map>
#include<set>

#define inf 2147483647
#define ri register int
#define ll long long

using namespace std;

inline void read(int &x){
    x=0;
    char t=getchar();
    bool f=0;
    
    while(t<'0' || t>'9'){
        if(t=='-')f=1;
        t=getchar();
    }
    
    while(t>='0' && t<='9'){
        x=(x<<3)+(x<<1)+t-'0';
        t=getchar();
    }
    
    if(f)x=-x;
}

inline void getnext();
inline void KMP();

char s1[1000005];
char s2[1000005];
int l1,l2;

int next[1000005];

int main(){
    scanf("%s",s1+1);
    scanf("%s",s2+1);
    
    l1=strlen(s1+1);
    l2=strlen(s2+1);
    
    getnext();
    
    KMP();
    
    for(ri i=1;i<=l2;i++)printf("%d ",next[i]);
    
    return 0;
}

inline void getnext(){
    int j=0;
    next[1]=0;
    
    for(ri i=2;i<=l2;i++){
        while(j && s2[i]!=s2[j+1])j=next[j];
        if(s2[i]==s2[j+1])j++;
        next[i]=j;
    }
}

inline void KMP(){
    int j=0;
    
    for(ri i=1;i<=l1;i++){
        while(j && s1[i]!=s2[j+1])j=next[j];
        if(s1[i]==s2[j+1])j++;
        
        if(j==l2){
            printf("%d
",i-j+1);
            j=next[j];
        }
    }
}