HDU 1711 Number Sequence（KMP 模板）

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int n,m;
int T[1000005];
int P[1000005];
int nexts[1000005];
int makenext(int T[],int nexts[])
{
    int q,k;
    nexts[0]=0;
    for(q=1,k=0;q<m;q++)
    {
        while(k>0&&(T[q]!=T[k]))
            k=nexts[k-1];
        if(T[q]==T[k])  k++;
        nexts[q]=k;
    }
}
int kmp(int T[],int P[],int nexts[])
{
    int i,q;
    for(i=0,q=0;i<n;i++)
    {
        while(q>0&&P[q]!=T[i])
            q=nexts[q-1];
        if(P[q]==T[i])  q++;
        if(q==m)    return (i-m+1+1);
    }
    return -1;
}
int main()
{
    int t;  scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d",&n,&m);
        for(int i=0;i<n;i++)
        {
            scanf("%d",&T[i]);
        }
        for(int i=0;i<m;i++)
        {
            scanf("%d",&P[i]);
        }
        makenext(P,nexts);
        int an=kmp(T,P,nexts);
        printf("%d\n",an);
    }
}

Number Sequence

Time Limit:5000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u

Submit  Status

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