最长回文
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 19739 Accepted Submission(s): 7211
Problem Description
给出一个只由小写英文字符a,b,c...y,z组成的字符串S,求S中最长回文串的长度.
回文就是正反读都是一样的字符串,如aba, abba等
回文就是正反读都是一样的字符串,如aba, abba等
Input
输入有多组case,不超过120组,每组输入为一行小写英文字符a,b,c...y,z组成的字符串S
两组case之间由空行隔开(该空行不用处理)
字符串长度len <= 110000
两组case之间由空行隔开(该空行不用处理)
字符串长度len <= 110000
Output
每一行一个整数x,对应一组case,表示该组case的字符串中所包含的最长回文长度.
Sample Input
aaaa abab
Sample Output
4 3
Manacher算法:http://articles.leetcode.com/longest-palindromic-substring-part-ii
#include<cstdio>
#include<cstring>
#include<iostream>
using namespace std;
#define MAXN 1000100
char s[MAXN], str[MAXN*2];
int len, p[MAXN*2];
void Manacher()
{
int mx = 0;
int id;
for (int i = 1; i < len; ++i) {
if (mx > i) p[i] = min(p[id*2-i], mx-i);
else p[i] = 1;
for (;str[i-p[i]]==str[i+p[i]];p[i]++);
if (p[i] + i > mx) { mx = p[i]+i; id = i; }
}
}
int main()
{
while (~scanf("%s", s))
{
getchar(); getchar;
len = strlen(s);
str[0]='$';
str[1]='#';
for (int i = 0; i < len; ++i)
{
str[(i << 1)+2] = s[i];
str[(i << 1)+3] = '#';
}
len = len * 2 + 2;
str[len]='\0';
Manacher();
int ans = 0;
for (int i = 0; i < len; ++i)
ans = max(ans, p[i]);
printf("%d\n", ans-1);
}
return 0;
}