Number Sequence

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, outputthe smallest one.        

输入描述:
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].
       
输出描述:
For each test case, you should output one line which only contain K described above. If no such K exists, output -1 instead.




#include<iostream>
using namespace std;
int Next[10001];
int match[10001];
int str[1000001];
int n,m;
void getNext()
{
    Next[0]=-1;
    Next[1]=0;
    int pos=2,cn=0;
    while(pos<m)
    {
        if(match[pos-1]==match[cn])
            Next[pos++]=++cn;
        else if(cn>0)
            cn=Next[cn];
        else
            Next[pos++]=0;
    }
}
int KMP()
{
    if(n<m)
        return -1;
    int start1=0,start2=0;
    while(start1<n&&start2<m)
    {
        if(str[start1]==match[start2])
        {
            start1++;
            start2++;
        }
        else
        {
            if(start2==0)
                start1++;
            else
            {
                start2=Next[start2];
            }
        }
    }
    if(start2==m)
        return start1-m;
    else
        return -1;
}
int main()
{
    int cases;
    cin>>cases;
    while(cases--)
    {
        cin>>n>>m;
        for(int i=0;i<n;i++)
            cin>>str[i];
        for(int j=0;j<m;j++)
            cin>>match[j];
        getNext();
        int temp=KMP();
        if(temp==-1)
            cout<<-1<<endl;
        else
            cout<<temp+1<<endl;
    }
    return 0;
}