HDU 3068 最长回文

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=3068

最长回文

Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)

Total Submission(s): 15144    Accepted Submission(s): 5544

Problem Description

给出一个只由小写英文字符a,b,c...y,z组成的字符串S,求S中最长回文串的长度.
回文就是正反读都是一样的字符串,如aba, abba等

Input

输入有多组case,不超过120组,每组输入为一行小写英文字符a,b,c...y,z组成的字符串S
两组case之间由空行隔开(该空行不用处理)
字符串长度len <= 110000

Output

每一行一个整数x,对应一组case,表示该组case的字符串中所包含的最长回文长度.

Sample Input

  
  

   
   aaaa

abab
  
  

Sample Output

  
  

   
   4
3
  
  

Source

2009 Multi-University Training Contest 16 - Host by NIT

Recommend

lcy

思路：求最长回文子串的长度。Manacher算法的模板题。

附上AC代码：

#include <bits/stdc++.h>
//#pragma comment(linker, "/STACK:102400000, 102400000")
using namespace std;
const int maxn = 110005;
char str[maxn], t[maxn<<1];
int p[maxn<<1];

int manacher(){
	int maxlen=0, maxid=0, i;
	for (i=1; str[i]!='\0'; ++i){
		t[i<<1] = str[i];
		t[i<<1|1] = '#';
	}
	t[0]='?', t[1]='#';
	int n=(i<<1)+2, id=0;
	t[n] = '\0';
	for (i=1; i<n; ++i){
		if (maxid > i)
			p[i] = min(p[2*id-i], maxid-i);
		else
			p[i] = 1;
		while (t[i+p[i]] == t[i-p[i]])
			++p[i];
		if (p[i]+i > maxid){
			maxid = p[i]+i;
			id = i;
		}
		if (p[i] > maxlen)
			maxlen = p[i];
	}
	return maxlen-1;
}

int main(){
	#ifdef LOCAL
	freopen("input.txt", "r", stdin);
	freopen("output.txt", "w", stdout);
	#endif
	while (~scanf("%s", str+1))
		printf("%d\n", manacher());
	return 0;
}