hdu1711

kmp算法

#include <iostream>
#include <memory.h>
using namespace std;

int a[1000002],b[10002],n,m;
int next[10002];

void getnext(int *s,int *next)
{
    next[0] = next[1] = 0;
    for(int  i = 1;i < m;i ++)
    {
        int j = next[i];
        while(j && s[i] != s[j])
        j = next[j];
        next[i + 1] = (s[i] == s[j] ? j + 1: 0);
    }
}

int kmp(int *a,int *b,int *next)
{
    getnext(b,next);
    int j = 0;
    for(int i = 0;i < n;i ++)
    {
        while(j && a[i] != b[j])
        j = next[j];
        if(a[i] == b[j])  j ++;
        if(j == m)
        return i - m + 1 + 1;
    }
    return -1;

}

int main()
{
    //ifstream cin("in.txt");
    int t;cin >> t;
    while(t --)
    {
        cin >> n >> m;
        for(int i = 0;i < n;i ++)
        cin >> a[i];
        for(int i = 0;i < m;i ++)
        cin >> b[i];
        cout << kmp(a,b,next) << endl;
    }
    return 0;
}