Palindrome

题目链接

http://poj.org/problem?id=3974

分析

枚举回文串中心位置（需分奇偶讨论），二分一个长度，使得中心位置左右该长度的区间“对称”。

用字符串哈希 $O(1)$ 判断是否“对称”，方法是倒序预处理，倒序查询子串哈希值。

AC代码

#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;

typedef unsigned long long ull;

const int maxl = 1e6 + 5, base = 13331;

ull h1[maxl], h2[maxl], pw[maxl];
char s[maxl];

inline ull hash1(int l, int r) {
	return h1[r] - h1[l - 1] * pw[r - l + 1]; 
}

inline ull hash2(int l, int r) {
	return h2[l] - h2[r + 1] * pw[r - l + 1];
}

int main() {
	pw[0] = 1;
	for (int i = 1; i < maxl; ++i) pw[i] = pw[i - 1] * base;
	int id = 0;
	while (scanf("%s", s + 1) && s[1] != 'E') {
		int sl = strlen(s + 1), ans = 0;
		h2[sl + 1] = 0;
		for (int i = 1; i <= sl; ++i)
			h1[i] = h1[i - 1] * base + s[i];
		for (int i = sl; i >= 1; --i)
			h2[i] = h2[i + 1] * base + s[i];
		for (int i = 1; i <= sl; ++i) {
			int l = 1, r = min(i - 1, sl - i);
			while (l < r) {
				int mid = (l + r + 1) >> 1;
				if (hash1(i - mid, i - 1) == hash2(i + 1, i + mid))
					l = mid;
				else r = mid - 1;
			}
			ans = max(ans, 2 * l + 1);
			l = 1, r = min(i - 1, sl - i + 1);
			while (l < r) {
				int mid = (l + r + 1) >> 1;
				if (hash1(i - mid, i - 1) == hash2(i, i + mid - 1))
					l = mid;
				else r = mid - 1;
			}
			ans = max(ans, 2 * l);
		}
		++id;
		printf("Case %d: %d\n", id, ans);
	}
	return 0;
}