hdu 1711（kmp算法）

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
   
   
   
   

 

题意就是在一个串里面找一个子串，并返回下标。

#include<iostream>
#include<set>
#include<map>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
#include<cmath>
using namespace std;
int numa[1000100], numb[10010], Next[10010], m, n;
void getnext()
{
      Next[0] = -1;
      int  i = 0, j = -1;
      while(i != m - 1)
      {
          if(j == -1 || numb[i] == numb[j])
          {
              ++i;
              ++j;
              Next[i] = j;
          }
          else
          {
              j = Next[j];
          }
      }
}
int kmp()
{
    getnext();
    int i = 0, j = 0;
    while(i != n && j != m)
    {
        if(j == -1 || numa[i] == numb[j])
        {
            i++;
            j++;
        }
        else
        {
            j = Next[j];
        }
    }
    if(j == m)
        return i - j + 1;
    else
        return -1;
}
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        scanf("%d%d", &n, &m);
        for(int i = 0; i<n; i++)
            scanf("%d", &numa[i]);
        for(int i =0; i<m; i++)
            scanf("%d", &numb[i]);
        printf("%d\n", kmp());
    }
    return 0;
}