HDOJ 1711 Number Sequence （KMP）

Number Sequence

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

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
  
  

 

KMP裸题

#include <cstdio>
#include <cstring>
using namespace std;
const int maxn = 1000000 + 10;
int t, n, m;
int a[maxn], b[maxn];
int next[maxn];

void getnext()
{
    int i = 0, j = -1;
    next[0] = -1;
    while (i != m){
        if (j == -1 || b[i] == b[j])
            next[++i] = ++j;
        else
            j = next[j];
    }
}

void KMP()
{
    int i = 0, j = 0;
    while (i != n && j != m){
        if (a[i] == b[j] || j == -1){
            ++i;
            ++j;
        }
        else
            j = next[j];
        if (j == m){
            printf("%d\n", i - m + 1);
            return;
        }
    }
    printf("-1\n");
}

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