HDU 3068 最长回文

最长回文

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

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

 

manacher算法模板题

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
#define less_speed ios::sync_with_stdio(false)
const int maxn=110007;
char str[maxn];
char str_new[maxn<<1];
int p[maxn<<1];
int init(){
	int len=strlen(str);
	str_new[0]='$';
	str_new[1]='#';
	int j=2;
	for(int i=0;i<len;i++){
		str_new[j++]=str[i];
		str_new[j++]='#';
	}
	str_new[j]='#';
	return j;
}
int solve(){
	int len=init();
	int max_len=-1;
	int id;
	int maxx=0;
	for(int i=1;i<len;i++){
		if(i<maxx){
			p[i]=min(p[2*id-i],maxx-i);
		}
		else p[i]=1;
		while(str_new[i-p[i]]==str_new[i+p[i]]) p[i]++;
		if(maxx<i+p[i]){
			id=i;
			maxx=i+p[i];
		}
		max_len=max(max_len,p[i]-1);
	}
	return max_len;
}
int main(){
	less_speed;
	//freopen("in.txt","r",stdin);
	//int Case=1;
	while(cin>>str){
		//if(strcmp(str,"END")==0) break;
		memset(p,0,sizeof(p));
		cout<<solve()<<endl;
		//printf("Case %d: %d\n",Case++,solve());
	}
	return 0;
}