Number Sequence
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 18008 Accepted Submission(s): 7875
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<stdio.h>
int main(void){
__int64 n,k,j,n1,n2,i,next[10001],text[1000000],pattern[10001];
scanf("%d",&n);
while(n--){
scanf("%d",&n1);
scanf("%d",&n2);
i=0;
while(i!=n1){
scanf("%I64d",&text[i++]);
}
i=0;
while(i!=n2){
scanf("%I64d",&pattern[i++]);
}
//获取next数组
next[0]=-1;
k=-1;j=0;
while(j<=n2){
if(k==-1||pattern[j]==pattern[k]){
++j;
++k;
next[j]=k;
}
else
k=next[k];
}
//kmp搜索
i=0;j=0;
while(i<n1&&j<n2){
if(j==-1||text[i]==pattern[j]){
i++;
j++;
}
else
j=next[j];
}
if(j==n2)
printf("%d\n",i-j+1);
else
printf("-1\n");
}
return 0;
}