题目:
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.
输入:
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].
输出:
For each test case, you should output one line which only contain K described above. If no such K exists, output -1 instead.
样例输入:
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
输入两个数组,从第一个数组里找到一个K位置,使得满足题目中的要求。
AC代码:
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;
const int maxn=1000005;
const int maxx=10005;
int a[maxn],b[maxx],net[maxx];//不能用next作为数组名,next是个关键字
int n,m;
void getnet()
{
net[0]=-1;
int k=-1;
int j=0;
while(j<m)
{
if(k==-1||b[j]==b[k])
{
++j;
++k;
if(b[j]!=b[k])//数组优化
net[j]=k;
else
net[j]=net[k];
}
else
{
k=net[k];
}
}
}
int Kmpserch()
{
getnet();
int i=0;
int j=0;
while(i<n&&j<m)
{
if(j==-1||a[i]==b[j])
{
i++;
j++;
}
else
{
j=net[j];
}
}
if(j==m)
return i-j+1;//之所以要加1的原因是第一个a[K]要等于b[1],如果等于b[0],就不用加1了
else
return -1;
}
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
scanf("%d%d",&n,&m);
for(int i=0;i<n;i++)
scanf("%d",&a[i]);
for(int i=0;i<m;i++)
scanf("%d",&b[i]);
if(Kmpserch()==-1)
printf("-1\n");
else
printf("%d\n",Kmpserch());
}
return 0;
}