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
题目大意:给定两串数组 : a[1], a[2], ...... , a[N], 和 b[1], b[2], ...... , b[M] (1 <= N <= 1000000, 1 <= M <= 10000)。你的任务是找到一个数字K使得a[K] = b[1], a[K + 1] = b[2], ...... , a[K + M - 1] = b[M]。如果存在多个K, 输出最小的那个。
题解:首先考虑KMP匹配, 但是这里不同的是,并不是求子串在母串的满足个数,而是找满足上面的k , 最后最早搜出来的K = i - m + 1 ;
AC代码:
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std ;
int a[1000000+10] , b[10000+10] ,pre[10000+10];
int n , m , t ;
void getpre()
{
int i=0,j=-1;
pre[0]=-1;
while(i<m)
{
if(j==-1||b[i]==b[j]) pre[++i]=++j;
else j=pre[j];
}
}
int kmp()
{
int i=0,j=0;
getpre();
while(i<n&&j<m)
{
if(j==-1||a[i]==b[j]) i++,j++;
else j=pre[j];
if(j==m)
return i-m+1;
}
return -1;
}
int main()
{
cin>>t;
while(t--)
{
cin>>n>>m;
for(int i = 0 ; i < n ;i++) scanf("%d",&a[i]);
for(int i = 0 ; i < m ;i++) scanf("%d",&b[i]);
cout<<kmp()<<endl;
}
return 0 ;
}