hdu 1711 Number 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<bits/stdc++.h>
using namespace std;

int Next[10007], a[1000007], b[10007];
int t,n,m;

void getnext(int a[])
{
	Next[0] = -1;
	int j = -1;
	for (int i = 1;i<m;i++)
	{
		while(a[i]!=a[j+1]&&j!=-1)
			j = Next[j];
		if(a[i]==a[j+1])
			j++;
		Next[i] = j;
	}
}
 
int kmp()
{
	getnext(b);
	int j = -1;
	for (int i = 0;i<n;i++)
	{
		while(a[i]!=b[j+1]&&j!=-1)
			j = Next[j];
		if(a[i]==b[j+1])
			j++;
		if(j==m-1)
			return i+2-m;
	}
	return -1;
}

 


int main()
{
	freopen("11.txt", "r", stdin);
	
	cin >> t;
	while(t--)
	{
		cin >> n >> m;
		for (int i = 0;i<n;i++)
			scanf("%d", &a[i]);
		for (int j = 0;j<m;j++)
			scanf("%d", &b[j]);
		cout << kmp() << endl;
	}

	return 0;
}