hdu3068 最长回文（Manacher模板）

最长回文

Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 16545    Accepted Submission(s): 6097

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

最长回文子串模板题，算法思想：http://www.cnblogs.com/biyeymyhjob/archive/2012/10/04/2711527.html

#include<stdio.h>
#include<algorithm>
#include<string.h>
using namespace std;
const int MAX = 110000 + 10;
char s[MAX * 2];
int p[MAX * 2];

int main()
{
	while (~scanf("%s", s)) 
	{
		int len = strlen(s), id = 0, maxlen = 0;
		for (int i = len; i >= 0; --i) 
		{
			s[i + i + 2] = s[i];
			s[i + i + 1] = '#';
		}
		s[0] = '*'; 
		for (int i = 2; i<2 * len + 1; ++i) 
		{
			if (p[id] + id>i)p[i] = min(p[2 * id - i], p[id] + id - i);
			else p[i] = 1;
			while (s[i - p[i]] == s[i + p[i]])++p[i];
			if (id + p[id]<i + p[i])id = i;
			if (maxlen<p[i])maxlen = p[i];
		}
		printf("%d\n", maxlen - 1);
	}
	return 0;
}