Hdu 5371 Manacher算法

#include<stdio.h>
#include<algorithm>

using namespace std;

const int N = 100008;

int a
;
int b[N<<1];
int p[N<<1];
int len;

void kp()
{
    int mx = 0, id = 0;
    for(int i = 0; i < len; i++)
    {
        if(mx > i)
            p[i] = min(p[(id<<1) - i], mx - i);
        else p[i] = 1;
        for(; i - p[i] >= 0 && b[i - p[i]] == b[i + p[i]]; p[i]++);
        if(p[i] + i > mx)
        {
            mx = p[i] + i;
            id = i;
        }
    }
}

int main ()
{
    int t;

    scanf("%d", &t);
    int k = 1;
    while(t--)
    {
        int n;
        scanf("%d", &n);
        len = 0;
        b[len++] = -1;
        for(int i = 0; i < n; i++){
            scanf("%d", &b[len++]);
            b[len++] = -1;
        }
        kp();
        int ans = 1;
        for(int i = 2; i < len-1; i += 2)
        {
            for(int j = ans; j <= p[i]; j+=2)
            {
                if(p[i+j-1] >= j)
                    ans = j;
            }
        }
        printf("Case #%d: %d\n", k++, ans/2*3);
    }

    return 0;

}
/*
10
10
3 2 2 3 3 2 15 6 7 0
*/