最长回文
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 14160 Accepted Submission(s): 5155
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://acm.hdu.edu.cn/showproblem.php?pid=3068
题意:中文题。。。
思路:回文串O(N)处理,
manacher算法,(!+‘#’变奇数处理!)详见:http://blog.csdn.net/lyhvoyage/article/details/38663487
代码:
#include<stdio.h>
#include<iostream>
#include<string.h>
#include<algorithm>
using namespace std;
#define maxn 1100005
char s[maxn],cpy[maxn<<1];
int seq[maxn<<1];
void manacher(char s[], int length, int rad[])
{
for (int i=1,j=0,k;i<length; i+=k)
{
while (s[i-j-1] == s[i+j+1]) j++;
rad[i] = j;
for (k = 1; k <= rad[i] && rad[i-k] != rad[i]-k; ++k) rad[i+k] = min(rad[i-k], rad[i]-k); //镜像处理
j = max(j-k, 0);
}
}
int main()
{
while(scanf("%s",s)!=EOF)
{
int len=strlen(s);
cpy[0]='(',cpy[1]='#';
for(int i=0,j=2;i<len;i++,j+=2)
{
cpy[j]=s[i];
cpy[j+1]='#';
}
len=len*2+3;
cpy[len-1]=')';
manacher(cpy,len,seq);
int maxx=1;
for(int i=0;i<len;i++)
maxx=max(maxx,seq[i]);
printf("%d\n",maxx);
}
}