Manacher最长回文子串模板（kuangbin)

const int MAXN=110010;
char ma[maxn*2];
int mp[maxn*2];
void manacher(char s[],int len)
{
    int l=0;
    ma[l++]='$';
    ma[l++]='#';
    for(int i=0;ii?min(mp[2*id-i],mx-i):1;
        while(ma[i+mp[i]]==ma[i-mp[i]])mp[i]++;    
        if(i+mp[i]>mx)
        {
            mx=i+mp[i];
            id=i;
        }
    }
}
char s[maxn];
int main()
{
    while(scanf("%s",s)==1)
    {
        int len=strlen(s);
        manacher(s,len);
        int ans=0;
        for(int i=0;i<2*len+2;i++)
        {
            ans=max(ans,mp[i]-1);
        }
        printf("%d\n",ans);
    }
    return 0;
}