Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 10196 Accepted Submission(s): 4636
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
看题目,明显是KMP,不过今天这个KMP,和往日有点不同,我们以前总是匹配char,今天要匹配int,其实都差不多...
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
void getnext(int);
int getseach(int,int);
int next[1000001]={0};
int s1[1000001]={0};
int s2[1000001]={0};
void getnext(int l)
{
int i=0,j=-1;
next[i]=-1;
while(i<l)
{
if(j==-1||s1[i]==s1[j])
{
++i;
++j;
next[i]=j;
}
else
{
j=next[j];
}
}
}
int getseach(int l1,int l2)
{
int i=0,j=0;
while(i<l1&&j<l2)
{
if(j==-1||s2[i]==s1[j])
{
++i;
++j;
}
else
{
j=next[j];
}
}
if(j>=l2-1)
return i-l2+1;
else
return -1;
}
int main()
{
int l1=0,l2=0,i,n,m,t;
int fh=0;
scanf("%d",&t);
while(t--)
{
memset(next,0,sizeof(next));
memset(s1,0,sizeof(s1));
memset(s2,0,sizeof(s2));
scanf("%d%d",&n,&m);
for(i=0; i<n; i++)
{
scanf("%d",&s2[i]);
}
for(i=0; i<m; i++)
{
scanf("%d",&s1[i]);
}
getnext(m);
fh=getseach(n,m);
printf("%d\n",fh);
}
return 0;
}
对于代码,不解释,反正这个代码是我背下来的,我不知道为什么,我没能理解掉KMP...