hdu 1711

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

#include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;
const int maxn = 10005;
int Next[maxn], a[1000010], b[maxn];
int lena, lenb;
void getnext()
{
  memset(Next, 0, sizeof(Next));
  int i = 0, j = -1;
  Next[0] = -1;
  while (i < lenb)
  {
    if (j == -1 || b[i] == b[j])
    {
      i++;
      j++;
      Next[i] = j;
    }
    else
      j = Next[j];
  }
}
int kmp()
{
  int i = 0, j = 0;
  int pos = -1;
  getnext();
  while (i < lena && j < lenb)
  {
    if (j == -1 || a[i] == b[j])
    {
      i++;
      j++;
    }
    else
      j = Next[j];
    if (j == lenb)
    {
      pos = i - j + 1;
    }
  }
  return pos;
}
int main()
{
  int t;
  scanf("%d", &t);
  while (t--)
  {
    scanf("%d%d", &lena, &lenb);
    for (int i = 0; i < lena; i++)
    {
      scanf("%d", &a[i]);
    }
    for (int i = 0; i < lenb; i++)
    {
      scanf("%d", &b[i]);
    }
    printf("%d\n", kmp());
  }
  return 0;
}