题目链接:2565:最长双回文串
回文自动机的讲解可以参考 WOJ 1583 Palindrome(回文自动机)
这道题是回文自动机的裸题,正反跑共两遍枚举断点更新答案即可
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const int maxn=110001;
const int maxs=26;
int n,m,ans[maxn],tmp[maxn],ret=0;
char s[maxn];
struct pam{
int next[maxn][maxs],sz;
int ro,re,last,l[maxn],fail[maxn];
void init(){
sz=0; s[0]='@';
sz++; ro=sz; l[ro]=-1; memset(next[sz],0,sizeof(next[sz]));
sz++; re=sz; l[re]=0; memset(next[sz],0,sizeof(next[sz]));
fail[ro]=ro; fail[re]=ro; last=ro;
}
bool gofail(int x,int c,int id){
return s[id-l[x]-1]-'a'==c;
}
void ins(int c,int id){
while (!gofail(last,c,id)) last=fail[last];
if (next[last][c]) last=next[last][c];
else{
int x=last; ++sz; next[x][c]=sz; l[sz]=l[x]+2;
memset(next[sz],0,sizeof(next[sz]));
if (x==ro){
fail[sz]=re;
}else{
x=fail[x];
while (!gofail(x,c,id)) x=fail[x];
fail[sz]=next[x][c];
}last=sz;
}ans[id]=l[last];
}
}pt;
int main(){
scanf("%s",s+1);
n=strlen(s+1);
pt.init();
for (int i=1;i<=n;++i) pt.ins(s[i]-'a',i);
for (int i=1;i<=n;++i) tmp[i]=ans[i];
for (int i=1;i<=n/2;++i) swap(s[i],s[n-i+1]);
pt.init();
for (int i=1;i<=n;++i) pt.ins(s[i]-'a',i);
for (int i=1;i<=n;++i) ret=max(ans[n-i]+tmp[i],ret);
printf("%d",ret);
}