HDU - 1711——Number Sequence

Number Sequence

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

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<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<queue>
using namespace std;
int kmp_next[10004], in2[10004], in1[1000002], n, m;
void getArrInt ( int *a, int n ) {
    for ( int i = 0; i < n; i++ )
        cin >> a[i];
}
void KMP_next ( int *a ) {
    int i = 0, j = -1;
    kmp_next[0] = -1;
    while ( i != m )
        if ( j == -1 || a[i] == a[j] )
            kmp_next[++i] = ++j;
        else j = kmp_next[j];
}
int KMP ( int *a, int *b ) {
    int i = 0, j = 0;
    while ( i != n ) {
        if ( j == -1 || a[i] == b[j] ) ++i, ++j;
        else j = kmp_next[j];
        if ( j == m )
            return i - m + 1;
    }
    return -1;
}
int main() {
    std::ios::sync_with_stdio ( false );
    cin.tie ( 0 );
    int T;
    cin >> T;
    while ( T-- ) {
        cin >> n >> m;
        getArrInt ( in1, n );
        getArrInt ( in2, m );
        KMP_next ( in2 );
        cout << KMP ( in1, in2 ) << endl;
    }
    return 0;
}