Number Sequence (KMP算法)

Number Sequence

Crawling in process... Crawling failed Time Limit:5000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u

Submit Status

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 
     
     

          

KMP模板题。注意：我们的数组起点是0，所以最后答案要加1。

代码如下：

#include<cstdio>
#include<iostream>
#include<cstring>
using namespace std;
int t[1000005];
int p[10005];
int Next[10005];
int n,m;
void makeNext(){
	int k,q;
	Next[0] = 0;
	for(q = 1,k = 0; q < m; q++){
		while(k>0 && p[k] !=p[q]){
			k = Next[k-1];
		}
		if(p[k] == p[q]){
			k++;
		}
		Next[q]=k;
	}
}
int kmp(){
	int i,q;
	makeNext();
	for(i = 0,q = 0; i < n;i++){
		while(q > 0 && t[i] != p[q]){
			q=Next[q-1];
		}
		if(t[i] == p[q]){
			q++;
		}
		if(q == m)return i-m+1;
	}
	return -1;
}
int main(){
	int cases,i,j;
	cin>>cases;
	while(cases--){
		cin>>n>>m;
		for(i = 0; i < n; i++)
		cin>>t[i];
		for(i = 0; i < m; i++)
		cin>>p[i];
		int ans = kmp();
		if(ans!=-1)
		cout<<ans + 1<<endl;//数组起点是0，所以最后答案要加1 
		else
		cout<<-1<<endl;
	}
	return 0;
}