扩展KMP模板

#include<iostream>
using namespace std;
const int N = 101010;
int next[N],extand[N];
void getnext(char *T) // next[i]: 以第i位置开始的子串 与 T的公共前缀
{
    int n=strlen(T);
    next[0]=n;
    int j=0;
    while(j+1<n&&T[j+1]==T[j])j++;
    next[1]=j;
    int k=1;
    for(int i=2;i<n;i++)
    {
        int p=k+next[k]-1;
        int l=next[i-k];
        if(i+l<p+1)next[i]=l;
        else
        {
            j=max(0,p-i+1);
            while(i+j<n&&T[i+j]==T[j])j++;
            next[i]=j;
            k=i;
        }
    }
}
void getextand(char *S,char *T)//extand的求法与next很类似
{
    memset(next,0,sizeof(next));
    getnext(T);
    int Slen = strlen(S), Tlen = strlen(T), a = 0;
    int MinLen = min(Tlen,Slen);
    while(a<MinLen && S[a]==T[a]) a++;
    extand[0] = a;
    a = 0;
    for(int k = 1; k < Slen; k++)
    {
        int p = a+extand[a]-1, L = next[k-a];
        if(k+l<p+1)extand[k]=L;
        else
        {
            int j = max(p-k+1,0);
            while(k+j<Slen && j<Tlen && S[k+j]==T[j] ) j++;
            extand[k] = j;
            a = k;
        }
    }
}
int main()
{
    char s[N],t[N];
    while(~scanf("%s %s",s,t))
    {
        getextand(s,t);
        for(int i = 0; i < strlen(t); i++)
            printf("%d ",next[i]);
        puts("");
        for(int i = 0; i < strlen(s); i++)
            printf("%d ",extand[i]);
        puts("");
    }
}