HDU 1711 - Number Sequence

题目大意：序列a，序列b，判断能否在序列a中找到序列b，如果能输出位置，不能输出-1。

解题思路：kmp裸题

ac代码：

#include <iostream>
#define N 1000005
using namespace std;
int n, m, t, T[N], S[N], Next[N];
void get_Next(int a[], int len, int Next[])
{
	int i = 0, j = -1;
	Next[0] = -1;
	while (i < len)
		if (j < 0 || a[i] == a[j])
			Next[++i] = ++j;
		else
			j = Next[j];
}
int kmp(int a[], int b[], int n, int m, int Next[])
{
	int i = 0, j = 0;
	get_Next(b, m, Next);
	while (i < n){
		if (j < 0 || a[i] == b[j])
			i++, j++;
		else
			j = Next[j];
		if (j == m)
			return i - m + 1;
	}
	return -1;
}
int main()
{
	scanf("%d", &t);
	while (t--){
		scanf("%d%d", &n, &m);
		for (int i = 0; i < n; i++)
			scanf("%d", &T[i]);
		for (int i = 0; i < m; i++)
			scanf("%d", &S[i]);
		printf("%d\n", kmp(T, S, n, m, Next));
	}
	return 0;
}