hdu--1711--kmp应用在整形数组--Number Sequence

/*
    Name: hdu--1711--Number Sequence
    Author: shen_渊
    Date: 16/04/17 19:58
    Description: 第一次知道，KMP能用在整形数组 o(╯□╰)o
*/

#include<cstring>
#include<iostream>
using namespace std;
int kmp();
void getFail();
int n,m;
],s2[];
];
int main()
{
//    freopen("in.txt","r",stdin);
    ios::sync_with_stdio(false);
    int T;
    cin>>T;
    while(T--){
        memset(s1,,));
        memset(s2,,));
        memset(f,,));
        cin>>n>>m;
        ; i<n; ++i)cin>>s1[i];
        ; i<m; ++i)cin>>s2[i];
        if(n < m)cout<<"-1\n";
        else cout<<kmp()<<endl;
    }
    ;
}
void getFail(){
    f[] = ;f[] = ;
    ; i<m; i++){
        int j = f[i];
        while(j && s2[i] != s2[j]) j = f[j];
        f[i+] = s2[i] == s2[j] ? j+:;
    }
}
int kmp() {
    getFail();
    ;
    ; i<n; ++i){
        while(j && s2[j] != s1[i]) j=f[j];
        if(s2[j] == s1[i]) j++;
        ;
    }
    ;
}