hdu1711 Number Sequence

今天学了下KMP算法，差不多理解咯，这题只要套一下模板就可以ko。昨天看了下最小表示法算法。看到中间头晕咯。相当无语，到现在还没懂。

include<iostream>
using namespace std;
const int maxn=1000005;
const int maxm=10005;
int a[maxn],b[maxm],next[maxm];
int n,m;
void getNext(int  *p, int m, int *next) {
    int i = 0, j = next[0] = -1;
    while(i < m) {
        if (j == -1 || p[i] == p[j]) {
        //    next[++i] = ++j;     // Morris & Pratt¦Ì???¡¤¡§
            ++i; ++j;
            next[i] = p[i] != p[j] ? j:next[j]; // Knuth¦Ì?????
        } else
            j = next[j];
    }//while
//for(i=0; i<=m; i++)printf("next[%d]=%d/n",i,next[i]);//D¡ê?¨¦
}//
int kmpIndex(int pos) {
    int i = pos, j = 0;
    while(i < n && j < m) {
        if (j == -1 || a[i] == b[j]) ++i, ++j;
        else j = next[j];
    }///while
    //return j >= m ? (i-m):-1;
    return j>=m?(i-m+1):-1;
}
int main()
{
    int T,i,j;
    cin>>T;
    while(T--)
    {
        cin>>n>>m;
        for(i=0;i<n;i++)
          cin>>a[i];
        for(i=0;i<m;i++)
          cin>>b[i];
        getNext(b,m,next);
        int ans=kmpIndex(0);
        cout<<ans<<endl;
    }
    return 0;
}