hdu3068（manacher）

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=3068

思路：manacher模板题

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cctype>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <sstream>
#include<iomanip>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll inff = 0x3f3f3f3f3f3f3f3f;
#define FOR(i,a,b) for(int i(a);i<=(b);++i)
#define FOL(i,a,b) for(int i(a);i>=(b);--i)
#define REW(a,b) memset(a,b,sizeof(a))
#define inf int(0x3f3f3f3f)
#define si(a) scanf("%d",&a)
#define sl(a) scanf("%I64d",&a)
#define sd(a) scanf("%lf",&a)
#define ss(a) scanf("%s",a)
#define mod int(1e9+7)
#define lc (d<<1)
#define rc (d<<1|1)
#define P pair<int,int>
#define pi acos(-1)
char a[110008],b[110008*2];
int d[110008*2];
int man()
{
    int ll=strlen(a);
    int l=0;
    b[l++]='#';
    int ans=0;
    FOR(i,0,ll-1)
    {
        b[l++]=a[i];
        b[l++]='#';
    }
    int id=0,mx=0;
    FOR(i,1,l-2)
    {
        if(mx>i)  d[i]=min(d[2*id-i],mx-i);
        else      d[i]=1;
        while(b[i-d[i]]==b[i+d[i]]&&i+d[i]<l)  d[i]++;
        if(i+d[i]>mx)
        {
            mx=i+d[i];
            id=i;
        }
        if(ans<d[i])  ans=d[i];
    }
    return ans;
}
int main()
{
    cin.tie(0);
    while(ss(a)!=EOF)
    {
        int s=man()-1;
        printf("%d\n",s);
    }
    return 0;
}