[HDU](1711)Number Sequence ---KMP（串）

Number Sequence

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

AC代码：

#include<iostream>
#include<cstdio>
using namespace std;
int s1[1000005];
int s2[1000005];
int nnext[1000005];
int n,m;
void setNext()
{
    int t=-1;
    nnext[0]=-1;
    int j=0;
    while(j<m-1)
    {
        if(t<0 || s2[j]==s2[t])
        {
            j++;
            t++;
            nnext[j]=t;
        }
        else
            t=nnext[t];
    }
}
int kmp()
{
    setNext();
    int i=0;
    int j=0;
    while(i<n && j<m)
    {
        if(j<0||s1[i]==s2[j])
        {
            i++;
            j++;
        }
        else
            j=nnext[j];
    }
    if(j==m)
        return i-j+1;
    else
        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",&s1[i]);
        for(int i=0;i<m;i++)
            scanf("%d",&s2[i]);
        int r=kmp();
        cout<<r<<endl;
    }
    return 0;
}

转载于:https://www.cnblogs.com/WangMeow/p/7535949.html