hdu1711_VJkuangbin16kmp_kmp裸题

裸题。。。打个版

#include <cstdio>

using namespace std;
const int maxn = 1000010;
const int maxm = 10010;
int n, m;
int s[maxn], p[maxm];
int next[maxm];

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

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

int main()
{
    int t;
    scanf("%d", &t);
    while(t--)
    {
        scanf("%d %d", &n, &m);
        for(int i = 0; i < n; ++i) scanf("%d", &s[i]);
        for(int i = 0; i < m; ++i) scanf("%d", &p[i]);
        int ans = kmp();
        printf("%d\n", ans);
    }
    return 0;
}