Kmp简单应用——Number Sequence

Given two sequences of numbers : a 1  1, a 2  2, ...... , a N  N, and b 1  1, b 2  2, ...... , b M  M (1 <= M <= 10000, 1 <= N <= 1000000). Your task is to find a number K which make a K  K = b 1  1, a K+1  K+1 = b 2  2, ...... , a K+M−1  K+M−1 = b M  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  1, a 2  2, ...... , a N  N. The third line contains M integers which indicate b 1  1, b 2  2, ...... , b M  M. All integers are in the range of −1000000,1000000  −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<cstdio>
#include<cstring>
#include<algorithm>
#define maxn 1000010
using namespace std;
int a[maxn],b[maxn];
int ne[maxn];
int main()
{
    int N,M;
    int T;
    scanf("%d",&T);
    while(T--){
        scanf("%d %d",&N,&M);
        int la=0,lb=0;
        for(int i=0;i<N;i++){
            scanf("%d",&a[i]);
            la++;
        }
        for(int i=0;i<M;i++){
            scanf("%d",&b[i]);
            lb++;
        }
        for(int i=0,j=-1;i<=lb;i++,j++){
            ne[i]=j;
            while(j!=-1&&b[i]!=b[j]) j=ne[j];
        }
        for(int i=0,j=0;i<=la;i++,j++){
            if(j==lb){
                printf("%d\n",i-j+1);
                goto l;
            }
            while(j!=-1&&a[i]!=b[j]) j=ne[j];
        }
        printf("-1\n");
        l:;
    }
    return 0;
}