HDU 1711 KMP 模板

KMP 入门题， 单模式串匹配

#include <iostream>
#include <cstring>
using namespace std;
const int N = 1000010;
const int M = 10010;
#define next Next
int s[N], t[M], next[M];
int n, m;

void getNext(){
    next[0] = -1,  next[1] = 0;
    int i = 1, j = 0;
    while(i < m){
        if(j == -1 || t[i] == t[j]) next[++i] = ++j;
        else j = next[j];
    }
 }

int kmp(){
    getNext();
    int i = 0, j = 0;
    while(i < n){
        if(j == -1 || s[i] == t[j]){
            ++i;
            ++j;
        }else j = next[j];
        if(j == m) return i + 1 - m;
    }
    return -1;
}

int main(){
    int T;
    cin >> T;

    while(T--){
        cin >> n >> m;
        for(int i = 0; i < n; ++i) cin >> s[i];
        for(int i = 0; i < m; ++i) cin >> t[i];
        cout << kmp() << endl;
    }

    return 0;
}