杭电1711Number Sequence

最新推荐文章于 2021-01-17 21:32:56 发布

hpuzsk

最新推荐文章于 2021-01-17 21:32:56 发布

阅读量507

点赞数

分类专栏： kmp 文章标签：杭电 kmp

本文链接：https://blog.csdn.net/z8110/article/details/47360335

版权

kmp 专栏收录该内容

4 篇文章 0 订阅

订阅专栏

Number Sequence

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

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

Source

HDU 2007-Spring Programming Contest

kmp算法，找到失配函数，然后就可以过了；

原来标记了一个flag 发现有bug，然后问大神，大婶说记住就行了。

#include<stdio.h>
#include<string.h>
long a[1000005],b[10005],p[10005],i,n,m,j,flag,k;
void getp()//找适配函数 
{
	int i=0;
	int j=-1;
	p[i]=j;
	while(i<n)
	{
		if(j==-1||b[i]==b[j])
		{
			i++;
			j++;
			p[i]=j;
		}
		else
		j=p[j];
	}
}
int kmp()
{
	getp();
	int i=0;
	int j=0;
	while(i<m)
	{
		if(j==-1||a[i]==b[j])
		{
			i++;
			j++;
			if(j==n)//如果找到了子序列； 
			{
				//flag=1;
				return i-n+1;
			}
		}
		else
		j=p[j];
	}
	return -1;//如果没有找到子序列； 
}
int main()
{
	scanf("%d",&k);
	while(k--)
	{
		flag=0;
		scanf("%ld%ld",&m,&n);
		for(i=0;i<m;i++)
		scanf("%ld",&a[i]);
		for(i=0;i<n;i++)
		scanf("%ld",&b[i]);
		
		//if(flag!=0)
		printf("%ld\n",kmp());
		//if(flag==0)
		//printf("-1\n");
	}
	return 0;
}