/*
hdu 1711
KMP
教训:
1、KMP的数组下标从0开始
*/
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
using namespace std;
#define ms(i,j) memset(i, j, sizeof i);
const int MAXN = 1000000 + 5, MAXM = 10000 + 5;
int f[MAXM], s1[MAXN], s2[MAXM];
int n, m;
void init()
{
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]);
}
}
void solve()
{
f[0] = f[1] = 0;
for (int i=1;i<m;i++)
{
int j = f[i];
while (j && s2[i]!=s2[j]) j = f[j];
f[i+1] = (s2[i]==s2[j]) ? (j+1) : (0);
}
int j = 0;
for (int i=0;i<n;i++)
{
while (j && s1[i]!=s2[j]) j = f[j];
if (s1[i]==s2[j]) j++;
if (j==m)
{
printf("%d\n", i-m+1+1);
return ;
}
}
printf("-1\n");
}
int main()
{
int t;
scanf("%d", &t);
while (t--)
{
init();
solve();
}
return 0;
}
|Hdu 1711|KMP|Number Sequence
最新推荐文章于 2018-11-22 14:26:17 发布