最长回文子串

#include<iostream>
#include<cstdio>
#include<string.h>
#include<cstring>
#include<string>
#include<stack>
#include<set>
#include<algorithm>
#include<cmath>
#include<vector>
#include<map>

#define LOCAL
#define ll long long
#define lll unsigned long long
#define MAX 1000009
#define eps 1e-8
#define INF 0x7fffffff
#define mod 1000000007

using namespace std;
/*

题意：

想法：Manacher算法

PS:http://taop.marchtea.com/01.05.html

*/

int p[MAX*2],mx ,id ;
char str[2*MAX];
char s[MAX];

void Manacher()
{
    mx  = 0;
    id = 0;
    memset(p,0,sizeof(p));
    for(int i = 1;str[i]!='\0';i++)
    {
        p[i] = mx>i?min(p[2*id - i],mx - i) : 1;
        while(str[i + p[i]] == str[i - p[i]] )
        {
            p[i]++;
        }
        if(i + p[i] > mx)
        {
            mx = i + p[i];
            id = i;
        }
    }
}
int main()
{
    //freopen("date.in","r",stdin);
    int T;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%s",s);
        int len = strlen(s);
        str[0] = '$';
        str[1] = '#';
        for(int i = 0;i<len;i++)
        {
            str[(i<<1) + 2] = s[i];
            str[(i<<1) + 3] = '#';
        }
        len = 2*len + 2;
        str[len] = '\0';
        Manacher();
        int _max = 0;
        for(int i = 0;i<len;i++)
        {
            _max = max(_max,p[i]);
        }
        printf("%d\n",_max - 1);
    }
    return 0;
}

因为在复习嘛，所以每天只能从hiho上学习算法了，房价就有时间刷题了：）