【hdu1711】Number Sequence——KMP

题目：

Number Sequence

Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 19270    Accepted Submission(s): 8280

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
  
  

 

Source

HDU 2007-Spring Programming Contest

描述：kmp模板题

题解：直接套版

代码：

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int maxn = 1e7 + 5;
int text[maxn], pattern[maxn];
int nxt[maxn];
int main()
{
	//freopen("input.txt", "r", stdin);
	int T;
	scanf("%d", &T);
	while (T--)
	{
		int n, m;
		scanf("%d%d", &n, &m);
		for (int i = 0; i < n; i++)
		{
			scanf("%d", &text[i]);
		}
		for (int i = 0; i < m; i++)
		{
			scanf("%d", &pattern[i]);
		}

		for (int i = 0, j = -1; i <= m; i++, j++)
		{
			nxt[i] = j;
			while (~j && pattern[i] != pattern[j])
				j = nxt[j];
		}
		int flag = 0;
		for (int i = 0, j = 0; i <= n; i++, j++)       //注意边界
		{
			if (j == m)
			{
				printf("%d\n", i - m+1);
				flag = 1;
				break;
			}
			while (~j && text[i] != pattern[j])
				j = nxt[j];
		}
		if (!flag)
			printf("-1\n");
	}
	return 0;
}