J - Non Super Boring Substring（Manacher+树状数组）

题意：求字符串s中good的子串的数量，一个子串是good的如果它不包含长度大于等于k的回文串。
思路：每个子串可以理解为每个前缀的每个后缀，利用Mancher算法算出长度大于等于k的回文，然后就树状数组区间搞一下每个回文对后面哪些位置有贡献，这里奇偶回文以及k的奇偶需要细致讨论。

const int N = 1e5 + 5;
char Ma[N << 1], s[N];
int r[N << 1];
int tree[N], n, k;
void add(int k, int num) 
{
	for (int i = k;i <= n; i += i & -i)
		tree[i] += num;
}
int read(int k)
{
	int sum = 0;
	for (int i = k;i > 0; i -= i & -i)
		sum += tree[i];
	return sum;
}
ll Manacher(char s[], int len)
{
	int l = 0;
	Ma[l++] = '$';
	Ma[l++] = '#';
	for (int i = 0;i < len;i++)
	{
		Ma[l++] = s[i];
		Ma[l++] = '#';
	}
	Ma[l] = 0;
	int mx = 0, id = 0;
	for (int i = 0;i < l;i++)
	{
		r[i] = mx > i ? min(r[2 * id - i], mx - i) : 1;
		while (Ma[i + r[i]] == Ma[i - r[i]])r[i]++;
		if (i + r[i] > mx)
		{
			mx = i + r[i];
			id = i;
		}
	}
	int idx = 0;
	int pre = 0;
	f(i, 2, l - 1)
	{
		if (Ma[i] != '#')idx++;
		if (r[i] - 1 >= k)
		{
			int need = k + 1 >> 1;
			need -= (Ma[i] != '#' && (k % 2 == 1));
			int L = idx + need;
			int be = idx - need;
			if (Ma[i] == '#')be++;
			int w = be - pre;
			add(L, w);
			pre = be;
		}
	}
	ll res = 0;
	f(i, 1, n)res += i - read(i);
	return res;
}
int main()
{
	//freopen("in.txt", "r", stdin);
	int t;t = in();
	while (t--)
	{
		k = in();
		memset(tree, 0, sizeof tree);
		scanf("%s", s);
		n = strlen(s);
		cout << Manacher(s, n) << endl;
	}
	return 0;
}