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, 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

kmp模板；

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<queue>
using namespace std;
const int MAXN=1000000+10;
const int MAXM=10000+10;
int n,m;
int s[MAXN],t[MAXM];
int nextra[MAXM];
void get_next()
{
    int i,k;
    nextra[0]=0;
    for(i=1,k=0; i<m; i++)
    {
        while(k>0&&t[i]!=t[k])
        {
            k=nextra[k-1];
        }
        if(t[i]==t[k])
            k++;
        nextra[i]=k;
    }
}
int kmp()
{
    get_next();
    int i,j;
    for(int i=0,j=0; i<n; i++)
    {
        while(j&&s[i]!=t[j])//失配，找滑行距离
            j=nextra[j-1];
        if(s[i]==t[j])//匹配成功，模式串向前移动一个
            j++;
        if(j==m)
            return i-m+2;
    }
    return -1;
}
int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d%d",&n,&m);
        for(int i=0; i<n; i++)
            scanf("%d",&s[i]);
        for(int i=0; i<m; i++)
            scanf("%d",&t[i]);
        printf("%d\n",kmp());
    }
}

参考学习：KMP算法

                 经典算法kmp