hdu 3068 最长回文（Manacher模板）

https://segmentfault.com/a/1190000008484167

#include <bits/stdc++.h>
using namespace std;
const int maxn=300010;
char s1[maxn],s2[maxn];

void init(){
    int len=strlen(s1),j=0;
    s2[j++]='$',s2[j++]='#';
    for(int i=0;i<len;i++)
        s2[j++]=s1[i],s2[j++]='#';
    s2[j++]='\0';
}

int id,mx,ans,p[maxn];
void manacher(){
    int len=strlen(s2);
    id=mx=ans=0;
    for(int i=1;i<len;i++){
        p[i]=i<mx?min(p[id*2-i],mx-i):1;
        while(s2[i+p[i]]==s2[i-p[i]]) ++p[i];
        if(i+p[i]-1>mx) id=i,mx=i+p[i]-1;
        ans=max(ans,p[i]-1);
    }
}

int main(){
    while(scanf("%s",s1)!=EOF){
        init();
        manacher();
        printf("%d\n",ans);
    }
    return 0;
}