题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1711点击打开链接
Number Sequence
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 32430 Accepted Submission(s): 13579
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模板题
#include <bits/stdc++.h>
using namespace std;
int s[1000005];
int t[1000005];
int nnext[1000005];
int n,m;
void getnnext()
{
int j=0,k=-1;
nnext[0]=-1;
while(j<m)
{
if(k==-1||t[j]==t[k])
{
j++;
k++;
nnext[j]=k;
}
else
k=nnext[k];
}
}
int kmp()
{
int i=0,j=0;
getnnext();
while(i<n)
{
if(j==-1||s[i]==t[j])
{
i++;
j++;
}
else
j=nnext[j];
if(j==m)
return i;
}
return -1;
}
int main()
{
int tt;
cin >> tt;
while(tt--)
{
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",&t[i]);
if(kmp()==-1)
printf("-1\n");
else
printf("%d\n",kmp()-m+1);
}
}