hdu 3294 Girls' research

        hdu 3294 Girls' research

        找到最长的回文子串并按题目中的字符偏移量输出. 使用manacher算法求解的.

#include <stdio.h>

#define MAX 200005
#define min(a, b) (a > b ? b : a)

char str[MAX], newStr[MAX*2];
char rep[2];
int p[MAX*2];
int s, e, pos, mx, id, maxLen;

inline char offset(char c) {
	return (c - rep[0] + 26) % 26 + 'a';
	// return ((c - 'a') - (rep[0] - 'a') + 26) % 26 + 'a';
}

int main() {
	int i;
	
	while (scanf("%s%s", rep, &str[1]) != EOF) {
		newStr[0] = '?', newStr[1] = '#';
		for (i = 1; str[i] != '\0'; i++) {
			newStr[i*2] = str[i];
			newStr[i*2 + 1] = '#';
		}
		newStr[i*2] = '\0';

		pos = 1;
		mx = id = maxLen = 0;
		for (i = 1; newStr[i] != '\0'; i++) {
			if (mx > i) {
				p[i] = min(p[2*id - i], mx - i);
			} else {
				p[i] = 1;
			}

			while (newStr[i - p[i]] == newStr[i + p[i]]) {
				p[i]++;
			}

			if (i + p[i] > mx) {
				mx = i + p[i];
				id = i;
			}

			if (maxLen < p[i]) {
				maxLen = p[i];
				pos = i;
			}
		}

		if (maxLen <= 2) {
			printf("No solution!\n");
		} else {
			if (pos % 2) {
				s = (pos / 2 - (maxLen - 1) / 2) + 1;
			} else {
				s = (pos / 2 - (maxLen - 1) / 2);
			}
			e = pos / 2 + (maxLen - 1) / 2;

			printf("%d %d\n", s - 1, e - 1);
			for (i = s; i <= e; i++) {
				printf("%c", offset(str[i]));
			} 

			printf("\n");
		}
	}

	return 0;
}