I Love Palindrome String --回文自动机+hash/manacher

题意是让你找出一个串里有几个满足本身是回文串且自己的前一半和后一半都是回文串的回文字串数，并且按长度分开统计。
刚开始直接想的是借助manacher的回文半径去做，狂码一顿之后发现复杂度已经炸了。后来看了题解提到了回文自动机（PAM）就懂了先处理本质不同字串并记录个数。可能是太久没写回文自动机了，这操作应该说中规中矩。然后就简单了 。然后我使用了PAM+manacher结果wa了无数次。被迫无奈manacher改了hash，真的是简单又好调一发过。

#include<bits/stdc++.h>
using namespace std;
const int maxn = 3e5+100;
int ans[maxn];
const int  MAXK = 30;
char str[ maxn + 5 ];
long long pl[maxn];
long long has[maxn];
const int p = 131;
void initp()
{
    pl[0] = 1;
    pl[1] = p;
    for (int i = 2; i <= maxn; ++i) {
        pl[i] = pl[i-1] * p;
    }
}
long long getHash(int l,int r)
{
    if (l == 0)
        return has[r];
    else return has[r] - has[l-1] * pl[r - l + 1 ];
}
int checked(int l,int r)
{
    int len = r - l + 1;
    int half = (len + 1)/2 ;
    if (getHash(r - half+1,r) == getHash(l,l + half - 1)) return 1;
    else return 0;
}

struct Palindrome_Automaton{
    int Size //总节点
    , Last , Root0 , Root1, ID[maxn + 5] , Trans[ maxn + 5 ][ MAXK + 5 ] , Fail[ maxn + 5 ];
    int  Len[ maxn + 5 ];
    long long CNT[maxn + 5];
    Palindrome_Automaton( ) {
        Root0 = Size ++ , Root1 = Size; Last = Root1;
        Len[ Root0 ] = 0  , Fail[ Root0 ] = Root1;
        Len[ Root1 ] = -1 , Fail[ Root1 ] = Root1;
    }
    void init()
    {
        Size = 0;
        Root0 = Size ++ , Root1 = Size; Last = Root1;
        Len[ Root0 ] = 0  , Fail[ Root0 ] = Root1;
        Len[ Root1 ] = -1 , Fail[ Root1 ] = Root1;
    }
    void Extend( int ch , int dex ) {
        int u = Last;
        while (str[ dex - Len[ u ] - 1 ] != str[ dex ] ) u = Fail[ u ]; //找到合格的后缀
        if( !Trans[ u ][ ch ] ) {         //无现成的边
            int Newnode = ++ Size , v = Fail[ u ];    //防止取掉整串
            Len[ Newnode ] = Len[ u ] + 2;
            while (str[ dex - Len[ v ] - 1 ] != str[ dex ] ) v = Fail[ v ];    //给他找一个fail指针
            Fail[ Newnode ] = Trans[ v ][ ch ] , Trans[ u ][ ch ] = Newnode;
        }
        Last = Trans[ u ][ ch ];
        ID[Last] = dex;
        CNT[Last]++;
    }

    void Build() {
        int len = strlen( str );
        for( int i = 0 ; i < len ; i ++ ) {
            Extend( str[ i ] - 'a' , i );
        }
    }
    void solve()
    {
        for (int i = Size; i >= 0; --i) {
            CNT[Fail[i]] += CNT[i];
        }
    }
}PAM;


int main()
{
    initp();
    while (cin >> str) {
        int len = strlen(str);
        has[0] = str[0] - 'a';
        for (int i = 1; i < len; ++i) {
            has[i] = has[i-1] * p;
            has[i] += str[i] - 'a';
        }
        memset(ans,0,sizeof(ans));
        PAM.init();
        memset(PAM.CNT,0,sizeof(PAM.CNT));
        memset(PAM.Trans,0,sizeof(PAM.Trans));
        PAM.Build();
        PAM.solve();
        for (int i = 0; i <= PAM.Size; ++i) {
            if (PAM.Len[i] > 0)
            {
                ans[PAM.Len[i]] += PAM.CNT[i] * checked(PAM.ID[i]-PAM.Len[i]+1,PAM.ID[i]);
            }
        }
        for (int j = 1; j <= len; ++j) {
            printf("%d%c",ans[j],j==len?'\n':' ');
        }
    }
}