最长回文
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 17842 Accepted Submission(s): 6585
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
直接用模板就过了;
静态与动态的一对比真的差好多:
看来动态能不用就不用;
1060ms:
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
#include<iostream>
using namespace std;
const int MAXN=5*1e5+66;
char str[MAXN]; string S;
int Manacher(string S)
{
int id=0,mx=0,i,ans=0;
int *p=new int[S.size()+1];
memset(p,0,sizeof(p));
for(i=1;i<S.size();++i)
{
p[i]=mx>i?min(p[(id<<1)-i],mx-i):1;
while(S[i+p[i]]==S[i-p[i]]) ++p[i];
if(i+p[i]>mx) {
id=i; mx=i+p[i];
}
ans=max(ans,p[i]);
}
delete p;
return ans-1;
}
int main()
{
int i;
while(~scanf("%s",str))
{
S.clear();
S+="$#";
for(i=0;str[i];++i)
{
S+=str[i]; S+="#";
}
cout<<Manacher(S)<<endl;
}
return 0;
}
450ms
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
#include<iostream>
using namespace std;
const int MAXN=5*1e5+66;
char str[MAXN],S[MAXN]; int p[MAXN];
int Manacher(char *S)
{
int id=0,mx=0,i,ans=0;
memset(p,0,sizeof(p));
for(i=1;S[i];++i)
{
p[i]=mx>i?min(p[(id<<1)-i],mx-i):1;
while(S[i+p[i]]==S[i-p[i]]) ++p[i];
if(i+p[i]>mx) {
id=i; mx=i+p[i];
}
ans=max(ans,p[i]);
}
return ans-1;
}
int main()
{
int i;
while(~scanf("%s",str))
{
S[0]='$';
for(i=0;str[i];++i)
{
S[(i<<1)+1]='#';
S[(i<<1)+2]=str[i];
}
S[(i<<1)+1]='#'; S[(i<<1)+2]='\0';
cout<<Manacher(S)<<endl;
}
return 0;
}