hdu 1711 Number Sequence

最新推荐文章于 2020-07-12 20:18:12 发布

hzhyhx1117

最新推荐文章于 2020-07-12 20:18:12 发布

阅读量256

点赞数

分类专栏：图论—KMP 文章标签： output numbers input each im

本文链接：https://blog.csdn.net/hzhyhx1117/article/details/7773950

版权

图论—KMP 专栏收录该内容

2 篇文章 0 订阅

订阅专栏

Number Sequence

Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 5645 Accepted Submission(s): 2529

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

Source

HDU 2007-Spring Programming Contest

Recommend

lcy

#include <stdio.h>
#include <string.h>
int N,M;
int a[1000005],b[10005],next[10005];
void getnext()
{
    int i=1,j=0;
    next[1]=-1;
    while(i<M)
    {
        if(j==0||b[j]==b[i])
        {
            j++;i++;
            if(b[j]==b[i])
               next[i]=next[j];
            else
               next[i]=j;
        }
       // else
          //      next[k]=j;
     //   }
        else
            j=next[j];
    }
}//模板
int kmp()
{
    int i=0,j=0;
    while(i<=N&&j<=M)
    {
        if(a[i]==b[j]||j==0)
        {i++;j++;}
        else
            j=next[j];

    }//模板
    if(j>=M)
        return i-M;
    else
        return -1;
}//令j=0使得程序看起来更清楚一些
int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        memset(a,0,sizeof(a));
        memset(b,0,sizeof(b));
        memset(next,0,sizeof(next));
        scanf("%d%d",&N,&M);
        for(int i=1;i<=N;i++)
            scanf("%d",&a[i]);
        for(int i=1;i<=M;i++)
            scanf("%d",&b[i]);
        getnext();
        printf("%d\n",kmp());
    }
}