BZOJ3620【KMP】

/* I will wait for you */

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <algorithm>
#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <string>
#define make make_pair
#define fi first
#define se second

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef map<int, int> mii;

const int maxn = 15010;
const int maxm = 1010;
const int maxs = 26;
const int inf = 0x3f3f3f3f;
const int P = 1000000007;
const double error = 1e-9;

inline ll read()
{
	ll x = 0, f = 1;
	char ch = getchar();
	while (ch < '0' || ch > '9')
		  f = (ch == '-' ? -1 : 1), ch = getchar();
	while (ch >= '0' && ch <= '9')
	 	  x = x * 10 + ch - '0', ch = getchar();
	return x * f;
}

int n, m, ans, fail[maxn], last[maxn];
char s[maxn];

int main()
{
	scanf("%s", s), n = strlen(s), m = read();

	for (int i = 0; i < n; i++) {
		memset(fail, 0, sizeof fail);
		memset(last, 0, sizeof last);
		
		fail[i + 1] = i;
		for (int j = i + 1; j < n; j++) {
			int pos = fail[j];
			while(pos > i && s[pos] != s[j])
				pos = fail[pos];
			fail[j + 1] = s[pos] == s[j] ? pos + 1 : i;
		}
		
		last[i] = inf;
		for (int j = i + 1; j < n; j++) {
			last[j] = last[fail[j + 1] - 1];
			fail[j] = fail[j + 1] - i;
			last[j] = fail[j] < m ? inf : min(last[j], fail[j]);
			ans += (last[j] * 2 <= j - i);
		}
	}
	
	printf("%d\n", ans);

	return 0;
}