HDU1711 Number Sequence【KMP】

Number Sequence

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

 

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

问题链接：HDU1711 Number Sequence

问题描述：找出模式串在文本串中第一次出现的位置

解题思路：KMP模板题

AC的C++程序：

#include<iostream>

using namespace std;

const int N=1000010;
const int M=10010;

int s[N],p[M],Next[M],n,m;

//求next数组，p为模式串 
void GetNext(int p[],int next[])
{
	next[0]=-1;
	int k=-1,j=0;
	while(j<m)
	{
		//p[k]表示前缀 p[j]表示后缀
		if(k==-1||p[k]==p[j])
		{
			k++;
			j++;
			if(p[k]!=p[j])
			  next[j]=k;
			else
			  next[j]=next[k];
		}
		else
		  k=next[k];  
	}
}

int KMP(int s[],int p[])
{
	GetNext(p,Next);
	int i=0,j=0;
	while(i<n&&j<m)
	{
		if(j==-1||s[i]==p[j])
		  i++,j++;
		else
		  j=Next[j];
	}
	if(j==m)
	  return i-j+1;
	else
	  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",&p[i]);
		printf("%d\n",KMP(s,p));
	}
	return 0;
}