题目描述:
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.
KMP算法,上数据结构的时候就没有弄清楚,直接套一下模板就可以了,AC代码:
#include<iostream>
#include<string>
#include<cstdio>
#include<string.h>
using namespace std;
const int N=1000005,M=100005;
int a[N],b[M],nextt[M];
int n,m;
void getnext(){
int i=1,j=0;
nextt[1]=0;
while(i<m){
if(j==0||b[i]==b[j]){
++i;++j;
if(b[i]!=b[j])
nextt[i]=j;
else
nextt[i]=nextt[j];
}
else
j=nextt[j];
}
}
int kmp(){
int i=1,j=1;
while(i<=n&&j<=m){
if(j==0||a[i]==b[j]){
++i;++j;
}
else
j=nextt[j];
}
if(j>m)
return i-m;
return 0;
}
int main(){
int kk,i;
scanf("%d",&kk);
while(kk--){
memset(a,0,sizeof(a));
memset(b,0,sizeof(b));
memset(nextt,0,sizeof(nextt));
//int n,m;
scanf("%d%d",&n,&m);
for(i=1;i<=n;++i)
scanf("%d",&a[i]);
for(i=1;i<=m;++i)
scanf("%d",&b[i]);
getnext();
int flag=kmp();
if(flag==0)
printf("-1\n");
else
printf("%d\n",flag);
}
return 0;
}