kmp（前缀函数

#include <string.h>
#include <algorithm>
#include <iostream>

using namespace std;
#define ll long long
#define mem(a, b) memset(a,b,sizeof(a))
#define INF 0x3f3f3f3f
#define DBG printf("this is a input\n")
#define fi first
#define se second
#define mk(a, b) make_pair(a,b)
#define p_queue priority_queue

ll gcd(ll a, ll b) {
    return b == 0 ? a : gcd(b, a % b);
}

ll lcm(ll a, ll b) {
    return a / gcd(a, b) * b;
}
int T, n ,m, cnt = 0;
int s1[1000005] , s2[1000005], s[5000005];
int Next[1000005];
void kmp()
{
    mem(Next,0);
    for(int i = 1 ; i < cnt ; i ++)
    {
        int j = Next[i-1]; //i-1的前缀比较大
        //ababc....eabab，这种情况下,S[0:1] == S[2:3] && s[0:3] == S[i-4:i-1]
        //Next[j-1]代表abab的前缀函数,可以知道Next[j-1]是最合适的长度,因为S[2:3] == S[i-2:i-1]
        while(j > 0 && s[i] != s[j]) j = Next[j-1];
        if(s[i] == s[j]) j ++;
        Next[i] = j;
    }
}
int main(void)
{
    cin>>T;
    while(T --)
    {
        cnt = 0;
        scanf("%d %d",&n, &m);
        for(int i = 0 ; i < n ; i ++)
            scanf("%d",&s1[i]);
        for(int i = 0 ; i < m ; i ++)
            scanf("%d",&s2[i]);
        //构造字符串时，模式串在前，待匹配串在后，中间需要一个分割（不出现在两个串中
        for(int i = 0 ; i < m ; i ++)
            s[cnt ++] = s2[i];
        s[cnt ++] = -1000005;
        for(int i = 0 ; i < n ; i ++)
            s[cnt ++] = s1[i];
        int ok = 1;
        kmp();
        for(int i = m ; i < cnt ; i ++)
        {
            if(Next[i] == m)
            {
                ok = 0;
                cout<<i-2*m+1<<endl;//位置为i-2*m+1
                break;
            }
        }
        if(ok)
            cout<<-1<<endl;
    }
}