Number Sequence HDU - 1711 kmp

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>
#include<string>
#include<cstring>
#include<cstdio>
using namespace std;
int a[1000000+5],b[10000+5],n,m;
void getNext(int *s,int *next)
{
    next[0]=-1;
    int k=-1;//表示前后缀共同的最长长度
    int j=0;
    while(j<m-1)
    {
        if(k==-1||s[j]==s[k])
        {
            ++k;++j;
            next[j]=k;
        }else{
            k=next[k];
        }
    }
}
int kmp(int *T,int *P,int *Next)
{
    int j=0,i=0;
    while(i<n&&j<m)
    {
        if(j==-1||T[i]==P[j]){
            i++;j++;
        }else{
            j=Next[j];
        }
    }
    if(j==m)return i-j+1;
    return -1;
}

int main()
{
    int t;cin>>t;
    while(t--){
        cin>>n>>m;
        for(int i=0;i<n;i++){
            scanf("%d",a+i);
        }
        for(int i=0;i<m;i++){
            scanf("%d",b+i);
        }
        int next[10000+5]={0};
        getNext(b,next);
        //for(int i=0;i<m;i++)printf("%d ",next[i]);
         int ans=kmp(a,b,next);
        cout<<ans<<endl;
    }
}