HDU-1711- Number Sequence

最新推荐文章于 2020-01-05 18:56:43 发布

浅眠流转

最新推荐文章于 2020-01-05 18:56:43 发布

阅读量154

点赞数

CC 4.0 BY-SA版权

分类专栏： HDU KMP 文章标签： HDU-1711- Number Sequence

本文链接：https://blog.youkuaiyun.com/qq_43750980/article/details/99684407

HDU 同时被 2 个专栏收录

16 篇文章

订阅专栏

KMP

6 篇文章

订阅专栏

本文探讨了KMP算法在数字序列匹配问题上的应用，通过将字符替换为数字，解决了寻找两个数列中特定子序列的问题。文章详细介绍了输入输出格式，样例输入输出，以及使用C++实现的代码示例。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Number Sequence

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

解题思路

这个也就是KMP的板子问题吧，比较简单只用把字符换成数字就行了

代码

#include<string>
#include<vector>
#include<iostream>
#include<string>

using namespace std;
#define vec vector<int>
int n,m,N;
int v[6000000];
vec nex(int  ne[])
{
	vec net(N);
	int j;
	for(int i=1;i<N;i++)
	{
		j=net[i-1];
		while(ne[i]!=ne[j]&&j>0)
		{
			j=net[j-1];
		}
		if(ne[i]==ne[j]) j++;
		net[i]=j;
	}
	return net;
}

int main()
{
	int t;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d%d",&n,&m);
		N=n+m+1;
		for(int i=m+1;i<N;i++) scanf("%d",&v[i]);
		for(int i=0;i<m;i++) scanf("%d",&v[i]);
		v[m]=1000009;
		int flag=-1;
		vec V=nex(v);
		for(int i=m+1;i<N;i++)
		{
			if(V[i]==m)
			{
				flag=i-m-m+1;
				break;
			}
		}
		printf("%d\n",flag);
	}	
	return 0;
}