hdu 1711 整理下水题

最新推荐文章于 2021-08-01 08:48:21 发布

__XINGLE

最新推荐文章于 2021-08-01 08:48:21 发布

阅读量294

点赞数

分类专栏：水题

本文链接：https://blog.csdn.net/qq_29055721/article/details/46508521

版权

水题专栏收录该内容

20 篇文章 0 订阅

订阅专栏

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

#include<stdio.h>
#include<string.h>
using namespace std;

int a[1000001];

int next[10001];
void getNext(int *b,int m)
{
	next[0]=next[1]=0;
     for(int i=1;i<m;i++){
     	int j=next[i];
     	while(j&&b[i]!=b[j])
     	j=next[j];
		next[i+1]=b[i]==b[j]?j+1:0; 
     }
}                          
int main()
{

	int t,n,m;
	int b[10001];
	scanf("%d",&t);
	while(t--)
	{
		int flag=0;
		scanf("%d%d",&n,&m);
		for(int i=0;i<n;i++){
			scanf("%d",&a[i]);
		}
		for(int i=0;i<m;i++){
			scanf("%d",&b[i]);
		}
		getNext(b,m);
		int i,j=0;
		for(i=0;i<n;i++){
			while(j&&a[i]!=b[j])
			j=next[j];
			if(a[i]==b[j])
			j++;
			if(j==m){
				flag=1;
				break;
			}
		}
		if(flag)
		printf("%d\n",i-m+2);
		else
		printf("%d\n",-1);
	}
}