kmp匹配模板

#include<iostream>
using namespace std;
char a[1000010];
char b[1000010];         //两个字符串数组，待匹配的两个字符串
int next1[1000010] , n,m; //n是字符串a的长度,m是字符串b的长度
int f[1000010];

//计算字符串的next数组
void calc_next()
{
	next1[1] = 0;
	for (int i = 2, j = 0; i <= n; i++)
	{
		while (j > 0 && a[i] != a[j + 1]) j = next1[i];
		if (a[i] == a[j + 1]) j++;
		next1[i] = j;
	}
}

//kmp算法f数组求法

void calc_f()
{
	for (int i = 1, j = 0; i <= m; i++)
	{
		while (j > 0 && (b[i] != a[j + 1] || j == n)) j = next1[i];
		if (b[i] == a[j + 1]) j++;
		f[i] = j;
	}
}

int main()
{
	return 0;
}