HDU 1711 Number Sequence ——KMP问题

Number Sequence

Time Limit : 10000/5000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other)

Total Submission(s) : 75   Accepted Submission(s) : 31

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

问题分析：

题目意思就是给你两个数组a和b，问你从a数组的第几个元素开始，后面的元素可以与b数组一一匹配，意思就是说b数组在a数组中的位置，如果有多个就输出最靠前的那个位置k，如果不能匹配就输出-1。KMP模板题。

参考代码：

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;

#define MAXN 1000009
int NEXT[MAXN],a[MAXN],b[MAXN];

void getNext(int len)
{
    NEXT[0]=-1;
    int i=0,k=-1;
    while(i<=len)
    {
        if(k==-1 || b[i]==b[k])
            NEXT[++i]=++k;
        else
            k=NEXT[k];
    }
}

int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        int n,m;
        cin>>n>>m;
        for(int i=0;i<n;i++)
            scanf("%d",&a[i]);
        for(int i=0;i<m;i++)
            scanf("%d",&b[i]);
        getNext(m);
        int i=0,j=0;
        while(i<n && j<m)
        {
            if(j==-1||a[i]==b[j])
                i++,j++;
            else
                j=NEXT[j];
        }
        if(j==m)
            cout<<i-m+1<<endl;
        else
            cout<<-1<<endl;
    }
}