Number Sequence （HDU-1711）

Number Sequence （HDU-1711）

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模板题

AC代码：

#include <stdio.h>
#include <math.h>
#include <iostream>
#include <string>
#include <string.h>
#include <algorithm>
#include <map>
#include <vector>
#include <queue>
#include <stack>
#define PI 3.1415926
#define maxx 1000010
using namespace std;
int n,m;
int p[10100];
int s[maxx];
void Getnextval(int *p, int next[])
{
    int plen=m;
    int i=0;
    int j=-1;
    next[0]=-1;

    while(i<plen)
    {
        if(j==-1 || p[i]==p[j])
        {
            i++;
            j++;
            if(p[i]!=p[j])
                next[i]=j;
            else
                next[i]=next[j];
        }
        else
            j=next[j];
    }
}
int KMP(int *s, int *p, int next[])
{
    Getnextval(p,next);
    int i=0;
    int j=0;
    int slen=n;
    int plen=m;
    while(i<slen && j<plen)
    {
        if(j==-1 || s[i]==p[j])
        {
            i++;
            j++;
        }
        else
            j=next[j];
    }

    if (j==plen)
        return i-j+1;
    return -1;
}
int main()
{
    int next[10100];
    int t;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d",&n,&m);
        for(int i=0; i<=n-1; i++)
        {
            scanf("%d",&s[i]);
        }
        for(int i=0; i<=m-1; i++)
        {
            scanf("%d",&p[i]);
        }
        if(n<m)
            printf("-1\n");
        else
            printf("%d\n", KMP(s,p,next));
    }
    return 0;
}