HDU-1711Number Sequence

题目信息：

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<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;

const int N=10010;
int  S[N*100],T[N],n,m;
int nextval[N];
void get_nextval() {
	int i=0,j=-1;
	nextval[0]=-1;
	while(i<m) {
		if(j==-1||T[i]==T[j]) {
			++i;
			++j;
			if(T[i]!=T[j])
				nextval[i]=j;
			else
				nextval[i]=nextval[j];
		} else
			j=nextval[j];
	}
}
int Index_KMP() {
	get_nextval();
	int i=0,j=0;
	while(i<n) {
		if(j==-1||S[i]==T[j]) {
			++i;
			++j;
		} else
			j=nextval[j];
	if(j==m)
		return i-m+1;
	}
	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]);
		if(n<m)
		printf("-1\n");
		else
		printf("%d\n",Index_KMP());
	}
}