HDU-1711 KMP算法的运用

Problem Description：
Given two sequences of numbers : a[1], a[2], … , a[N], and b[1], b[2], … , b[M] (1 <= M <= 10000, 1 <= N <= 1000000). Your task is to find a number K which make a[K] = b[1], a[K + 1] = b[2], … , a[K + M - 1] = b[M]. If there are more than one K exist, output the smallest one.
Input
The first line of input is a number T which indicate the number of cases. Each case contains three lines. The first line is two numbers N and M (1 <= M <= 10000, 1 <= N <= 1000000). The second line contains N integers which indicate a[1], a[2], … , a[N]. The third line contains M integers which indicate b[1], b[2], … , b[M]. All integers are in the range of [-1000000, 1000000].
Output
For each test case, you should output one line which only contain K described above. If no such K exists, output -1 instead.

Sample Input
2
13 5
1 2 1 2 3 1 2 3 1 3 2 1 2
1 2 3 1 3
13 5
1 2 1 2 3 1 2 3 1 3 2 1 2
1 2 3 2 1
Sample Output
6
-1
题意：
输出模式串在主串第一次出现的位置。
解题思路：
KMP算法
代码：

#include<bits/stdc++.h>
#define rep(i,s,t) for(int i=s;i<=t;++i)
#define clr(a,b) memset(a,b,sizeof(a))
#define maxn 10005
using namespace std;
int nex[maxn],a[maxn],b[1000005];	//a模式串 b主串
inline int read(){				//cin会超时，用快读
    int x=0,f=1;char ch=getchar();
    while(ch>'9'||ch<'0'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    return x*f;
}
void GetNext(int c){
	int i=0,j=-1;
	nex[0]=-1;
	while(i<c-1){
		if(j==-1||a[i]==a[j]){
			++i,++j;
			nex[i]=j;
		}
		else j=nex[j];
	}
}
int KMP(int c,int d){
	GetNext(d);
	int i=0,j=0;
	while(i<c&&j<d){
		if(j==-1||b[i]==a[j]){
			++i,++j;
		}
		else j=nex[j];
	}
	if(j==d)return i-j+1;
	return -1;
}
int main(){
	int n=read();
	while(n--){
		clr(nex,0);
		int c=read(),d=read();
		rep(i,0,c-1)b[i]=read();
		rep(i,0,d-1)a[i]=read();
		printf("%d\n",KMP(c,d));
	}
	return 0;
}