Number Sequence（KMP）

Number Sequence
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 56352 Accepted Submission(s): 22538
题目来源：杭州电子科技大学
Problem Description
Given two sequences of numbers : a[1], a[2], … , a[N], and b[1], b[2], … , b[M] (1 <= M <= 10000, 1 <= N <= 1000000). Your task is to find a number K which make a[K] = b[1], a[K + 1] = b[2], … , a[K + M - 1] = b[M]. If there are more than one K exist, output the smallest one.
Input
The first line of input is a number T which indicate the number of cases. Each case contains three lines. The first line is two numbers N and M (1 <= M <= 10000, 1 <= N <= 1000000). The second line contains N integers which indicate a[1], a[2], … , a[N]. The third line contains M integers which indicate b[1], b[2], … , b[M]. All integers are in the range of [-1000000, 1000000].
Output
For each test case, you should output one line which only contain K described above. If no such K exists, output -1 instead.
Sample Input

2
13 5
1 2 1 2 3 1 2 3 1 3 2 1 2
1 2 3 1 3
13 5
1 2 1 2 3 1 2 3 1 3 2 1 2
1 2 3 2 1

Sample Output

6
-1

源码：

#include <iostream>
using namespace std;
int z[1000005],mc[1000005];
int nex[1000005];
int m,n;
void next()
{
    int i=0,j=-1;
    nex[0]=-1;
    while(i<n)
    {
        if(j==-1||z[i]==z[j])
        {
            i++;
            j++;
            nex[i]=j;
        }
        else
            j=nex[j];
    }
}

int KMP()
{
    int i=0,j=0,sum;
    while(i<m&&j<n)
    {
        if(j==-1||mc[i]==z[j])
        {
            i++;
            j++;
        }
        else
            j=nex[j];
    }
    if(j==n)
        return (i-j+1);
    else
        return (-1);
}

int main()
{
    int h,i,j;
    cin>>h;
    while(h--)
    {
        cin>>m>>n;
        for(i=0; i<m; i++)
        {
            cin>>mc[i];
        }
        for(i=0; i<n; i++)
        {
            cin>>z[i];
        }
        if(n>m)
            cout<<"-1"<<endl;
        else
        {
            next();
            cout <<KMP()<<endl;
        }
    }
    return 0;
}