题目:
分析:
m a n a c h e r manacher manacher算法裸体,表示洛谷题解很香
代码:
// luogu-judger-enable-o2
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<set>
#include<queue>
#include<vector>
#include<map>
#include<list>
#include<ctime>
#include<iomanip>
#include<string>
#include<bitset>
#include<deque>
#include<set>
#define LL long long
using namespace std;
inline LL read(){
LL d=0,f=1;char s=getchar();
while(s<'0'||s>'9'){if(s=='-')f=-1;s=getchar();}
while(s>='0'&&s<='9'){d=d*10+s-'0';s=getchar();}
return d*f;
}
int min(int x,int y) {return x>y?y:x;}
int max(int x,int y) {return x<y?y:x;}
char s[11000005],z[11000005];
int len;
void change()
{
z[0]=z[1]='#';
for(int i=0;i<len;i++)
z[i*2+2]=s[i],z[i*2+3]='#';
len*=2;len+=2;
z[len]=0;
return;
}
int ans[22000005];
void manacher()
{
int maxright=0,mid;
for(int i=1;i<len;i++)
{
if(i<maxright)
ans[i]=min(ans[(mid<<1)-i],ans[mid]+mid-i);
else ans[i]=1;
for(;z[i-ans[i]]==z[i+ans[i]];++ans[i]);
if(i+ans[i]>maxright) maxright=i+ans[i],mid=i;
}
return;
}
int main()
{
scanf("%s",s);
len=strlen(s);
change();
manacher();
int king=1;
for(int i=1;i<len;i++) king=max(king,ans[i]);
cout<<king-1;
return 0;
}