KMP模板题 Number Sequence HDU1711

模板...嗯

#include <iostream>
#include <cstdio>
#include <string.h>
#pragma warning ( disable : 4996 )
using namespace std;

const int inf = 0x3f3f3f3f;
const int maxn = 1e4+5;
const int vspot = 1e6+5;

int net[maxn];
int num[maxn], test[vspot];
int N, M, ans;

void getnext()
{
    memset( net, 0, sizeof(net) );
    ans = 0;
    int len = M;

    int k = -1, j = 0;
    net[j] = -1;

    while ( j < len-1 )
    {
        if ( k==-1 || num[j]==num[k] )
        {
            k++;
            j++;
            net[j] = k;
        }
        else
            k = net[k];
    }
}

void solve()
{
    int i = 0, j = 0;
    while ( i < N && j < M )
    {
        if( j == -1 || test[i] == num[j] )
        { i++; j++; }
        else
            j = net[j];
    }
    if( j == M )
        ans = i-j+1;
    else
        ans = -1;
}

int main()
{
    int all;
    cin >> all;
    while (all--)
    {
        cin >> N >> M;
        for( int i = 0; i < N; i++ )
            scanf( "%d", &test[i] ); 
        for( int i = 0; i < M; i++ )
            scanf( "%d", &num[i] ); 

        getnext();
        solve();
        printf( "%d
", ans );
    }
    return 0;
}