[HDU] 1711 Number Sequence KMP

http://acm.hdu.edu.cn/showproblem.php?pid=1711

题意：很裸的KMP，只不过把字符换成数字了。

思路：KMP

#include <cstdio>
#include <cstring>
#include <iostream>

using namespace std;

const int maxn = 1000010;

int n, m;
int Next[maxn];
int arg[maxn],str[10010];

void GetNext()
{
    Next[0] = -1;
    int i = 0, k = -1;
    while(i < m){
        if(k == -1 || str[i] == str[k]){
            i++,k++;
            Next[i] = k;
        }
        else{
            k = Next[k];
        }
    }
}

int Kmp()
{
    int i = 0, k = 0;
    while(i < n){
        if(k == -1 || arg[i] == str[k]){
            i++,k++;
            if(k == m)
                return i-m+1;
        }
        else{
            k = Next[k];
        }
    }
    return -1;
}

int main()
{
    int Test;
    cin>>Test;
    while(cin>>n>>m)
    {
        for(int i = 0; i < n; i++){
            cin>>arg[i];
        }
        for(int i = 0; i < m; i++){
            cin>>str[i];
        }
        GetNext();
        cout<<Kmp()<<endl;
    }
    return 0;
}