Number Sequence
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<iostream>
using namespace std;
int n, m;
int a[1000005], b[10005], nextb[10005],ans;
void getnext()
{
nextb[0] = 0;
for(int i=1,j=0;i<m;i++)
{
while(b[i]!=b[j]&&j)
{
j=nextb[j-1];
}
if(b[i]==b[j])
{
nextb[i]=++j;
}
else nextb[i]=0;
}
}
void kmp()
{
getnext();
int i=0,j=0;
for(;i<n;i++)
{
while(j&&a[i]!=b[j])
j=nextb[j-1];
if(a[i]==b[j])
{
j++;
}
if(j==m)
{
ans=(i+1)-(j-1);
return;
}
}
}
int main()
{
int t;
cin >> t;
while (t--)
{
cin >> n >> m;
for (int i = 0; i < n; i++)
{
cin >> a[i];
}
for (int i = 0; i < m; i++)
{
cin >> b[i];
}
ans=-1;
kmp();
cout<<ans<<endl;
}
return 0;
}
后记:c++过了,g++超时,卷毛狒狒摸不着头脑