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.
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
题意:
求出子串在主串中第一次出现循环的位置 (KMP入门)
代码:
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
int nex[10005];
int n,m,f;
int a[1000005],b[10005];
void get_next(){
int j=-1,i=0;
nex[0]=-1;
while(i<m){
if(j==-1 || b[j]==b[i])nex[++i]=++j;
else j=nex[j];
}
}
void KMP(){
get_next();
int j=0,i=0;
while(i<n){
if(j==-1 || a[i]==b[j]){
i++;j++;
}else j=nex[j];
if(j==m){
printf("%d\n",i-m+1);
f=0;
break;
}
}
}
int main()
{
int t;
scanf("%d",&t);
while(t--){
f=1;
scanf("%d%d",&n,&m);
for(int i=0;i<n;i++)scanf("%d",&a[i]);
for(int j=0;j<m;j++)scanf("%d",&b[j]);
KMP();
if(f)printf("-1\n");
}
return 0;
}