HDU 1711 Number Sequence（KMP匹配数字串）

　　这个就是kmp的数组形式,不用来处理字符串还真有点不习惯呢...

#include<iostream>
using namespace std;
const int MAXN = ,MAXM = ;
int T[MAXN],P[MAXM],Next[MAXM];
void MakeNext(int M)
{
    Next[] = -;
    int i = , j = -;
    while(i<M)
    {
        if(j==-||P[i]==P[j])
        {
            i++,j++;
            if(P[i]!=P[j])Next[i] = j;
            else Next[i] = Next[j];
        }
        else j = Next[j];
    }
}
int KMP(int N,int M)
{
    int i=,j=;
    while(i<N&&j<M)
    {
        if(T[i]==P[j]||j==-)i++,j++;
        else j = Next[j];
    }
    if(j==M)return i-M+;
    else return -;
}
int main()
{
    int N,M,C;
    scanf("%d",&C);
    while(C--)
    {
        scanf("%d%d",&N,&M);
        for(int i=; i<N; i++)scanf("%d",&T[i]);
        for(int i=; i<M; i++)scanf("%d",&P[i]);
        if(M>N)printf("-1\n");
        else
        {
            MakeNext(M);
            printf("%d\n",KMP(N,M));
        }
    }
    return ;
}