HDU 1686 Oulipo KMP

题意：给出一个模式串和一个待匹配串，求模式串在待匹配串中出现的次数
思路：KMP匹配成功后答案+1，返回fail位置继续匹配直到匹配到待匹配串尾

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<vector>
#include<queue>
#include<map>
#include<algorithm>
using namespace std;
typedef long long ll;
const int maxn = 1e6+5;
const int inf = 0x3f3f3f3f;
int n, m, fail[maxn], T, ans;
char s[maxn], p[maxn];
void getFail()
{
	fail[0] = -1;
	int k = -1, j = 0;
	while (j < m - 1) {
		if (k == -1 || p[j] == p[k]) {
			j++;
			k++;
			fail[j] = k;
		}
		else
			k = fail[k];
	}
}
void kmp()
{
	int i = 0, j = 0;
	while (i < n) {
		if (j == -1 || s[i] == p[j]) {
			i++;
			j++;
		}
		else 
			j = fail[j];
		if (j == m) {
			ans++;
			i--; j--;
			j = fail[j];
		}
	}
}
int main()
{
	scanf("%d", &T);
	for (int t = 0; t < T; t++) {
		scanf("%s%s", p, s);
		n = strlen(s);
		m = strlen(p);
		ans = 0;
		getFail();
		kmp();
		printf("%d\n", ans);
	}
	return 0;
}