数字版kmp
#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 1000100;
const int MAX_M = 10010;
#define sci(num) scanf("%d",&num)
int str[MAX_N],ps[MAX_M];
int nxt[MAX_M];
int lents,lenps;
void kmp_pre(int* t) {
nxt[0] = -1;
for (int i = 0,k = -1;i < lenps;) {
if (k == -1 || t[i] == t[k]) {
nxt[++i] = ++k;
while (nxt[i] != -1 && t[i] == t[nxt[i]])
nxt[i] = nxt[nxt[i]];
} else {
k = nxt[k];
}
}
}
int KMP(int* ts,int* ps)
{
kmp_pre(ps);
for (int i = 0,j = 0;i < lents && j < lenps;)
{
if (j == -1 || ts[i] == ps[j]) {
i++;
j++;
} else {
j = nxt[j];
}
if (j == lenps ) return i - lenps + 1;
}
return -1;
}
int main() {
int cases;
sci(cases);
while (cases--) {
sci(lents); sci(lenps);
for (int i = 0;i < lents;i++) {
sci(str[i]);
}
for (int i = 0;i < lenps;i++) {
sci(ps[i]);
}
printf("%d\n",KMP(str,ps));
}
return 0;
}