KMP算法

#include<bits/stdc++.h>
#define ll long long
#define R register int
#define inf 0x3f3f3f3f
#define mod 1000000007;
using namespace std;
inline ll read(){
ll s=0,w=1;
char ch=getchar();
while(ch<‘0’||ch>‘9’){if(ch==’-’)w=-1;ch=getchar();}
while(ch>=‘0’&&ch<=‘9’) s=s10+ch-‘0’,ch=getchar();
return sw;
}
void put1(){ puts(“YES”) ;}
void put2(){ puts(“NO”) ;}
void put3(){ puts("-1"); }

const int manx=1e6+5;
ll a[manx],b[manx],nexts[manx];
ll n,m;

void getnexts()
{
int i=0,j=-1;
nexts[i]=j;
while(i<m){
if(j==-1 || b[i]b[j]) nexts[++i]=++j;
else j=nexts[j];
}
}
ll kmp()
{
getnexts();
int i=0,j=0;
while(i<n && j<m){
if( j-1 || a[i]b[j] ) ++i,++j;
else j=nexts[j];
}
if(jm) return i-j+1;
else return -1;
}
int main()
{
ll p=read();
while(p–)
{
n=read(),m=read();
for(int i=0;i<n;i++) a[i]=read();
for(int i=0;i<m;i++) b[i]=read();
cout<<kmp()<<endl;
}
return 0;
}