HDU 1711 Number Sequence【KMP】

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入门题。

CODE:

View Code

#include<stdio.h>
#include<string.h>
int n[1000001];
int m[10001];
int next[10001];
int N,M,flag;
void getnext()
{
int i=0,j=-1;
    next[0]=-1;
while(i<M-1)
    {
if(j==-1||m[i]==m[j])
        {
            i++;j++;
if(m[i]!=m[j])
                next[i]=j;
else next[i]=next[j];
        }
else j=next[j];
    }
}
void kmp()
{
int i=0,j=0;
while(j<M&&i<N)
    {
if(j==-1||n[i]==m[j])
        {
            i++;j++;
        }
else j=next[j];
    }
if(j>=M)
    {
        flag=0;
        printf("%d\n",i-M+1);
    }
}    
int main()
{
int t,i;
    scanf("%d",&t);
while(t--)
    {
        flag=1;
            scanf("%d%d",&N,&M);
for(i=0;i<N;i++)
            scanf("%d",&n[i]);
for(i=0;i<M;i++)
            scanf("%d",&m[i]);
        getnext();
        kmp();
if(flag)
            printf("-1\n");
    }
return 0;
}

转载于:https://www.cnblogs.com/dream-wind/archive/2012/03/14/2396400.html