考察KMP,计算子串的个数
将子串与带查找字符串结合,建立回溯数组
遍历就行了
#include<bits/stdc++.h>
using namespace std;
int nex[10001]={-1};
int s1[1000005],s2[10005];
int x,y;
void getNext()
{
for(int i=1;i<10001;i++)nex[i]=0;
int j=0,k=-1;
while (j<y-1)
{
if(k==-1||s2[j]==s2[k])
{
k++;j++;
nex[j]=k;
}
else k=nex[k];
}
}
int kmpget(){
int i=0,j=0;
while (i<x&&j<y)
{
if(j==-1||s1[i]==s2[j])
{
j++;i++;
}
else
j=nex[j];
}
if(j==y)return i-y;
else return -1;
}
int main()
{
//freopen("C:\\Users\\Lenovo\\Desktop\\input.txt","r",stdin);
int n,input;
scanf("%d",&n);
while (n--)
{
int ans=0;
scanf("%d%d",&x,&y);
for(int i=0;i<x;i++){
scanf("%d",&s1[i]);
}
for(int i=0;i<y;i++){
scanf("%d",&s2[i]);
}
getNext();
ans=kmpget();
if(ans!=-1)ans++;
printf("%d\n",ans);
}
return 0;
}