bzoj2342 [Shoi2011]双倍回文

这道字符串题竟然不是scoi的

枚举对称轴x，考虑用len(x+1,y)*4更新答案，则必须满足y-p[y]<=x，y<=x+p[x]/2。

那么我们按照y-p[y]排序后，每次询问比x+p[x]/2小的最大值就可以了。

set大法好。

因为本题只讨论长度为偶数的回文子串，所以不需要加上#号（然而我傻逼加了，自行去掉即可）。

#include<set>
#include<cstdio>
#include<vector>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;

inline int read() {
	int x = 0, flag = 1; char ch = getchar();
	while (ch > '9' || ch < '0') { if (ch == '-') flag = -1; ch = getchar(); }
	while (ch <= '9' && ch >= '0') { x = x * 10 + ch - '0'; ch = getchar(); }
	return x * flag;
}

#define rep(ii, aa, bb) for (int ii = aa; ii <= bb; ii++)
#define drp(ii, aa, bb) for (int ii = aa; ii >= bb; ii--)
#define N 1000001

int n;
char s[N];
int p[N], f[N];
int q[N];

bool cmp(int a, int b) {
	return a - f[a] < b - f[b];
}

int main() {
	scanf("%d", &n);
	scanf("%s", s + 1);
	drp(i, n, 1) s[i * 2] = s[i], s[i * 2 - 1] = '*';
	s[0] = '#'; s[2 * n + 1] = '*';

	int id = 0;
	rep(i, 2, 2 * n + 1) {
		if (id + p[id] - 1 < i) p[i] = 1;
		else p[i] = min(p[2 * id - i], id + p[id] - i);
		while (s[i + p[i]] == s[i - p[i]]) p[i] ++;
		if (i + p[i] > id + p[id]) id = i;
	}

	rep(i, 1, n) f[i] = (p[i * 2 + 1] - 1) / 2, q[i] = i;
	sort(q + 1, q + n + 1, cmp);
	int pos = 1, ans = 0;
	set<int> st;
	rep(i, 1, n) {
		while (pos <= n && q[pos] - f[q[pos]] <= i) st.insert(q[pos]), pos++;
		set <int> ::iterator it = st.upper_bound(i + f[i] / 2);
		if (it != st.begin())ans = max(ans, (*--it - i) * 4);
	}
	cout << ans;
	return 0;
}