hdu-1711-Number Sequence (KMP)

Number Sequence

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

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

  
  

   
   6
-1
  
  

题意：

给你一个序列a，一个序列b，让你找到b十分存在于a中，存在的话输出b存在于a的起始地址（如果多个情况的话输出最小的），不存在的话输出-1.

解题思路：KMP模板题。

code: 

#include<cstdio>
#include<cstring>
#define MAXN 10010
#define LEN 1000010
using namespace std;
int next[MAXN],a[MAXN],b[LEN];
int n,m;
void get_next()
{
    next[0]=-1;
    int k=-1,j=0;
    while(j<m){
        if(k==-1||a[k]==a[j]){
            k++;j++;
            next[j]=k;
        }else
            k=next[k];
    }
}
int kmp()
{
    int i=0,j=0;
    while(i<n){
        if(j==-1||a[j]==b[i]){
            i++;j++;
        }
        else
            j=next[j];
        if(j==m)
            return i-m+1;
    }
    return -1;
}
int main()
{
    int t;
    scanf("%d",&t);
    while(t--){
        scanf("%d %d",&n,&m);
        for(int i=0;i<n;i++)
            scanf("%d",&b[i]);
        for(int i=0;i<m;i++)
            scanf("%d",&a[i]);
        get_next();
        printf("%d\n",kmp());
    }
    return 0;
}