HDU 1711 Number Sequence

Number Sequence

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
  
  
  
  


  
  

题意：求后一个字符串出现在前一个字符串的哪一个位置，如果没有出现就输出-1。

几乎就是kmp算法模板。

#include<bits/stdc++.h>
#define N 1000001
#define M 10001
using namespace std;
int n,m;
int ne[M];
int a[N];
int b[M];
void getnext()
{
    int i,j;
    i=0;
    j=-1;
    ne[0]=-1;
    while(i<m)
    {
        if(j==-1||b[i]==b[j])
            ne[++i]=++j;
        else
            j=ne[j];
    }
}

int kmp()
{
    int i,j;
    j=0,i=0;
    while(i<n)
    {
        if(a[i]==b[j])
        {
            if(j==m-1)
                return i-j+1;
            i++;
            j++;
        }
        else
        {
            j=ne[j];
            if(j==-1)
            {
                i++;
                j=0;
            }
        }
    }
    return -1;
}


int main()
{
    int t;
    int i;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d",&n,&m);
        for(i=0; i<n; i++)
            scanf("%d",&a[i]);
        for(i=0; i<m; i++)
            scanf("%d",&b[i]);
        if(n<m)
        {
            printf("-1\n");
            continue;
        }
        getnext();
        printf("%d\n",kmp());
    }
    return 0;
}