Number Sequence hdu1711 KMP

http://acm.hdu.edu.cn/showproblem.php?pid=1711

这个是单纯的KMP应用，串匹配~。第一回自己写，照着演示的代码来写的。

#include <iostream>
using namespace std;
#define N 1000003
#define M 10003
int a[N],b[M],nextd[M];

void getnext(int len){
	nextd[0]=-1;
	nextd[1]=0;
	int up=1,down=0;
	while (up<len){
		if (down==0||b[up]==b[down]){
			up++;
			down++;
			if (b[up]!=b[down])
				nextd[up]=down;
			else nextd[up]=nextd[down];
		}
		else down=nextd[down];
	}
}

int indexKMP(int n,int m){
	int i=1,j=1;
	while (i<=n&&j<=m){
		if (j==0||a[i]==b[j]){
			i++;
			j++;
		}
		else 
			j=nextd[j];
	}
	if (j>m)
		return i-m;
	else return -1;
}

int main(){
#ifndef ONLINE_JUDGE
	freopen("1711in.txt","r",stdin);
#endif
	int t,n,m,i;
	scanf("%d",&t);
	while (t--){
		scanf("%d%d",&n,&m);
		for (i=1;i<=n;i++) //最好是这样读入啦。
			scanf("%d",&a[i]);
		for (i=1;i<=m;i++)
			scanf("%d",&b[i]);
		getnext(m);
		printf("%d\n",indexKMP(n,m));
	}
	return 0;
}