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.
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
6 -1
只要理解kmp算法,这题都不难,注意当n<m时,直接输出-1.。。。
#include<cstdio>
#include<cstring>
int a[1000005],b[10005];
int next[10005],n,m;
void GetNext()
{
int i=0,j=-1;
next[0]=-1;
while(i<m)
{
if(j==-1||b[i]==b[j])
{
i++;
j++;
if(b[i]==b[j])
next[i]=next[j];
else
next[i]=j;
}
else
j=next[j];
}
}
int KMP()
{
int i=0,j=0;
while(i<n)
{
if(a[i]==b[j])
{
if(j==m-1)
return i-j+1;
i++;
j++;
}
else
{
j=next[j];
if(j==-1)
{
i++;
j=0;
}
}
}
return -1;
}
int main()
{
int cas,i;
while(~scanf("%d",&cas))
{
while(cas--)
{
scanf("%d%d",&n,&m);
for(i=0;i<n;i++)
scanf("%d",a+i);
for(i=0;i<m;i++)
scanf("%d",b+i);
if(n<m) printf("-1\n");
else{
GetNext();
printf("%d\n",KMP());
}
}
}
return 0;
}