oj2772 KMP简单应用

KMP教程http://www.cnblogs.com/c-cloud/p/3224788.html

#include<stdio.h>
#include<string.h>
void makeNext(const char P[],int next[])
{
    int q,k;
    int m = strlen(P);
    next[0] = 0;
    for (q = 1,k = 0; q < m; ++q)
    {
        while(k > 0 && P[q] != P[k])
            k = next[k-1];
        if (P[q] == P[k])
        {
            k++;
        }
        next[q] = k;

    }

}

int kmp(const char T[],const char P[],int next[])
{
    int n,m;
    int i,q;
    int flag=0;
    n = strlen(T);
    m = strlen(P);
    makeNext(P,next);
    for (i = 0,q = 0; i < n; ++i)
    {
        while(q > 0 && P[q] != T[i])
            q = next[q-1];
        if (P[q] == T[i])
        {
            q++;
        }
        if (q == m)
        {
            flag=1;
            printf("%d\n",(i-m+2));
        }
    }
    if(flag==0)printf("-1\n");
}
int next[1000020]={0};
char T[1000020];
char P[1000020];
int main()
{
    int i;

    while(~scanf("%s %s",T,P))
    // makeNext(P,next);
    {
        kmp(T,P,next);
    }
}