kmp超级版

来源：互联网发布：万圣节面具淘宝编辑：程序博客网时间：2024/05/05 12:14
#include<stdio.h>
int N,M,a[1000010],b[10010],next[10010]; 
void getnext() 
{ 
    inti=0,j=-1;next[0]=-1; 
    while(i!=M)
    {
        if(j==-1||b[i]==b[j])
        {
            i++;j++;
            if(b[i]!=b[j])
                next[i]=j;
            else
                next[i]=next[j];
        }
        else
            j=next[j];
    }
} 
int kmp() 
{ 
    inti=0,j=0; 
    while(i!=N&&j!=M)
    {
        if(a[i]==b[j])
        {
            i++;j++;
        }
        else
        {
            if(next[j]==-1)
            {
                ++i;j=0;
            }
            else
                j=next[j];
        }
    }
    if(j==M)
        returni-j+1; 
    else
        return-1; 
} 
int main() 
{ 
    intT; 
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d%d",&N,&M);
        for(inti=0;i<N;i++) 
            scanf("%d",&a[i]);
        for(inti=0;i<M;i++) 
            scanf("%d",&b[i]);
        for(inti=0;i<M+1;i++) 
            next[i]=0;
        getnext();
        printf("%dn",kmp());
    }
    return0; 
}