HDU 171１ Number Sequence（kmp模板）

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1711

Number Sequence

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

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>
#include <string.h>
int Num[1000010],num[10010];
int next[10010];
int main()
{
	int t,n,m;
	scanf("%d", &t );
	while( t--)
	{
		scanf("%d%d", &n , &m );
		for( int i = 0; i < n ; i ++ )
		{
			scanf("%d",&Num[i]);
		}
		for( int i = 0; i < m ; i ++ )
		{
			scanf("%d",&num[i]);
		}
		int j = 0,k=-1;
		next[0] = -1;
		while (j < m-1)
		{
			if( k == -1 || num[j] == num[k])
			{
				++j;
				++k;
				if( num[j] != num[k])
					next[j] = k;
				else 
					next[j] = next[k];
			}
			else 
			{
				k = next[k];
			}
			//printf("%d %d\n",j,next[j]);
		}
		int temp;
		int i = 0;j = 0 ;
		while( i < n && j < m)
		{
			if(j == -1 || Num[i] ==num [j])
			{
				i++;
				j++;
			}
			else 
			{
				j = next[j];
			}
		}
		if( j == m )
		{
			printf("%d\n",i-j+1);
		}
		else 
			printf("-1\n");
	}
	return 0;
}