[kuangbin专题] KMP HDU 1711 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

 

题目大意：给两个串，找子串最早在主串中匹配的位置，没匹配到的话输出-1

KMP直接匹配就ok了

 

AC代码

#include <stdio.h>
int next[10100],a1[1000100],a2[10100];
void getnext(int m){
	int i=0,j=-1;
	next[0]=-1;
	while(i<m){
		if(j==-1||a2[i]==a2[j]){
			j++;i++;
			next[i]=j;
		}
		else j=next[j];
	}
}
void kmp(int n,int m){
	int i=0,j=0;
	int flag=1;
	while(i<n){
		if(j==-1||a1[i]==a2[j]){
			i++;
			j++;
		}
		else j=next[j];
		if(j==m){
			printf("%d\n",i-j+1);
			flag=0;
			return;
		}
	}
	if(flag) printf("-1\n");
}
int main(){
	int t;
	scanf("%d",&t);
	while(t--){
		int i,j,n,m;
		scanf("%d%d",&n,&m);
		for(i=0;i<n;i++){
			scanf("%d",&a1[i]);
		}
		for(i=0;i<m;i++){
			scanf("%d",&a2[i]);
		}
		getnext(m);
		kmp(n,m);
	}
	return 0;
}