Manachar模板

#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cstdio>
#include <queue>
#include <set>
#include <map>
#include <vector>
#include <complex>
using namespace std;
const int N=1e6;

char s[N+5];
int p[N+5];
int slen;

int Manacher()//返回最长回文子串长度
{
    int ans=0, id=0;
    p[0]=1;
    for(int i=1; i<slen; i++)
    {
        p[i]= p[id]+id>i ? min(p[2*id-i],p[id]+id-i):1;
        while(s[i+p[i]]==s[i-p[i]])
            p[i]++;
        id= i+p[i]>id+p[id] ? i:id;
        ans=max(ans,p[i]);
    }
    return ans-1;
}

int main()
{
    while(scanf("%s",s)!=EOF)
    {
        slen=strlen(s);
        for(int i=slen; i>=0; i--) //插入了len+1个'#',最终的s长度是1~(len+len+1)即2*len+1,首尾s[0]和s[2*len+2]要插入不同的字符
        {
            s[i*2+2]=s[i];
            s[i*2+1]='#';
        }
        s[0]='*';    //s[0]='*',s[len*2+2]='\0',防止在while时p[i]越界
        slen=slen*2+2;
        int ans=Manacher();
        printf("%d\n",ans);
    }
    return 0;
}