Time limit
5000 ms
Memory limit
32768 kB
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
题意:两个数组的下脚标都是从1开始的,从第二个数组元素全部在第一个数组中出现时在母串中的位置,如果没有,输出-1。
我建立next[]数组时下脚标是从0开始的,并且初始化为next[0]=-1。
#include<stdio.h>
#include<string.h>
const int maxn = 1e6+10;
int s[maxn],p[maxn];
int next[maxn];
int n,m;
void Getnext() //创建next[]数组
{
int i=0,j=-1;
while(i<m)
{
if(j==-1 || p[i]==p[j])
{
j++;
i++;
next[i]=j;
}
else
j=next[j];
}
}
void kmp()
{
int i=0,j=0;
while(i<n && j<m)
{
if(j==-1 || p[j] == s[i])
{
i++;
j++;
}
else
j=next[j];
}
if(j==m)
printf("%d\n",i-j+1); //下角标是从0开始的,所以最后结果+1
else
printf("-1\n");
}
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
memset(s,0,sizeof(s));
memset(p,0,sizeof(p));
memset(next,0,sizeof(next));
next[0]=-1;
scanf("%d %d",&n,&m);
for(int i=0;i<n;i++)
scanf("%d",&s[i]);
for(int i=0;i<m;i++)
scanf("%d",&p[i]);
Getnext();
kmp();
}
return 0;
}