【练习03】 KMP 1001 Number Sequence

很纯正的KMP，模板函数只需做很小的改动，只是把char *P, char *T换成int* P和int* T。

//模板开始
#include <string>   
#include <vector>   
#include <algorithm>   
#include <iostream>   
#include <sstream>   
#include <fstream>   
#include <map>   
#include <set>   
#include <cstdio>   
#include <cmath>   
#include <cstdlib>   
#include <ctime>
#include<iomanip>
#define SZ(x) (int(x.size()))
using namespace std;

int toInt(string s){
	istringstream sin(s); 
	int t; 
	sin>>t; 
	return t;
}
template<class T> string toString(T x){
	ostringstream sout; 
	sout<<x; 
	return sout.str();
}
typedef long long int64;
int64 toInt64(string s){
	istringstream sin(s); 
	int64 t; 
	sin>>t;
	return t;
}
template<class T> T gcd(T a, T b){ 
	if(a<0) 
		return gcd(-a, b);
	if(b<0) 
		return gcd(a, -b);
	return (b == 0)? a : gcd(b, a % b);
}
//模板结束（通用部分）

//【练习03】 KMP 1001 Number Sequence 

#define MAX_SIZE 1000005 * 2
#define ifs cin

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

int find(int* T, int*P, int*f, int n, int m)
{
	getFail(P, f, m);
	int j = 0;
	for(int i = 0; i < n; i++)
	{
		while(j && P[j] != T[i])
		{
			j = f[j];
		}
		if(P[j] == T[i])
		{
			j++;
		}
		if(j == m)
		{
			return i - m + 1;
		}
	}
	return -1;
}

int main()
{
	//ifstream ifs("shuju.txt", ios::in);
	int cases;
	int result;
	int n, m;
	int* P = new int[MAX_SIZE];
	int* f = new int[MAX_SIZE];
	memset(f, 0, MAX_SIZE * sizeof(int));
	int* T = new int[MAX_SIZE];
	ifs>>cases;
	for(int i = 0; i < cases; i++)
	{
		ifs>>n>>m;
		for(int k = 0; k < n; k++)
		{
			ifs>>T[k];
		}

		for(int k = 0; k < m; k++)
		{
			ifs>>P[k];
		}

		result = find(T, P, f, n, m);
		if(result == -1)
		{
			cout<<-1<<endl; 
		}
		else if (result >= 0)
		{
			cout<<result + 1<<endl;
		}
	}
	return 0;
}