Number Sequence——kmp基础

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
就单纯把字符串改成数组就ok

 #include <iostream>
 #include <string.h>
 using namespace std;
 int Next[10005];
 int a[1000000];
 int b[10000];
 int i = 0, j = 0;
 int n = 0;
 void getnext(int next[], int str[], int m)
 {
     int j = 0, k = -1;
     next[0] = -1;
     while (j < m)
     {
         if (k == -1 || str[j] == str[k])
         {
             j++;
             k++;
             next[j] = k;
         }
         else
             k = next[k];
     }
 }
 int kmp(int str1[], int str2[], int n, int m)
 {
     
     int i = 0, j = 0;
     while (i < n && j < m)
     {
         if (j == -1 || str1[i] == str2[j])
         {
             i++;
             j++;
         }
         else
             j = Next[j];
     }
     if (j == m)
         return (i - m + 1);
     return -1;
 }
 int main()
{
     scanf("%d", &n);
     while (n--)
     {
         scanf("%d %d", &i, &j);
         for (int k = 0; k < i; k++)
             scanf("%d", &a[k]);
         for (int k = 0; k < j; k++)
             scanf("%d", &b[k]);
         getnext(Next, b, j);
         cout << kmp(a, b, i, j) << endl;
     }
    return 0;
}