hdu6599 I Love Palindrome String

由样例可知，题目中求的回文串数量，其实是本质不同的回文串数量，这个可以直接用回文树来做。

考虑前半段是回文串这个限制，这个东西回文树不好做，可以再套一个马拉车，然后记录一下插入到回文树的节点中最后一个字符的位置，使用马拉车快速判断这一段的前半段是不是回文串

#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
#include <vector>
#define fo(i, l, r) for (int i = l; i <= r; i++)
#define fd(i, l, r) for (int i = r; i >= l; i--)
#define mem(x) memset(x, 0, sizeof(x))
#define ll long long
using namespace std;
const int maxn = ;
ll read()
{
    ll x = , f = ;
    char ch = getchar();
    while (!(ch >= '' && ch <= ''))
    {
        if (ch == '-')
            f = -;
        ch = getchar();
    };
    while (ch >= '' && ch <= '')
    {
        x = x *  + (ch - '');
        ch = getchar();
    };
    return x * f;
}

char Ma[maxn * ];
int Mp[maxn * ];
void Manacher(char s[], int len)
{
    int l = ;
    Ma[l++] = '$';
    Ma[l++] = '#';
    for (int i = ; i < len; i++)
    {
        Ma[l++] = s[i];
        Ma[l++] = '#';
    }
    Ma[l] = ;
    int mx = , id = ;
    for (int i = ; i < l; i++)
    {
        Mp[i] = mx > i ? min(Mp[ * id-i], mx-i) : ;
        while (Ma[i + Mp[i]] == Ma[i-Mp[i]])
            Mp[i]++;
        if (i + Mp[i] > mx)
        {
            mx = i + Mp[i];
            id = i;
        }
    }
}

const int N = , S = ;
int all, son[N][S], fail[N], cnt[N], len[N], text[N], pos[N], last, tot;
int newnode(int l)
{
    for (int i = ; i < S; i++)
        son[tot][i] = ;
    cnt[tot] = , len[tot] = l;
    return tot++;
}
void init()
{
    last = tot = all = ;
    newnode(), newnode(-);
    text[] = -, fail[] = ;
}
int getfail(int x)
{
    while (text[all - len[x] - ] != text[all])
        x = fail[x];
    return x;
}
void add(int w,int p)
{
    text[++all] = w;
    int x = getfail(last);
    if (!son[x][w])
    {
        int y = newnode(len[x] + );
        fail[y] = son[getfail(fail[x])][w];
        son[x][w] = y;
        pos[y] = p;
    }
    cnt[last = son[x][w]]++;
}
void count()
{
    for (int i = tot - ; ~i; i--)
        cnt[fail[i]] += cnt[i];
}
char s[maxn];
int slen, s2[maxn];
ll ans[maxn];
int flag;
inline bool check(int l,int r){
    int len = r-l+;
    if(len==)return true;
    r = (l+r)>>;
    len = r-l+;
    if(len&){
        int t = l + (len>>);
        t *= ;
        return Mp[t]- >= len;
    }else{
        int t = l + (len >> );
        t = t*-;
        return Mp[t]- >= len;
    }
}
void dfs(int u, int d)
{
    fo(i, , )
    {
        if (son[u][i])
        {
            s2[d + ] = i;
            dfs(son[u][i], d + );
        }
    }
    if (d)
    {
        int lenu = d + d - flag;
        int rp = pos[u];
        int lp = pos[u]-lenu+;
        if(check(lp,rp))ans[d + d - flag] += cnt[u];
    }
}
int main()
{
    int tt = ;
    int T;
    while (scanf("%s", s + ) != EOF)
    {
        init();
        memset(ans, , sizeof(ans));
        slen = strlen(s + );
        fo(i, , slen)
        {
            add(s[i] - 'a',i);
        }
        count();
        Manacher(s+,slen);
        flag = ;
        dfs(, );
        flag = ;
        dfs(, );
        printf("%lld", ans[]);
        fo(i, , slen)
        {
            printf(" %lld", ans[i]);
        }
        putchar('\n');
    }
    return ;
}