bzoj2342: [Shoi2011]双倍回文 pam

题解:先建pam,然后在fail树上dfs,从上到下的链如果有当前长度最远回文串的一半,那么更新答案

//#pragma GCC optimize(2)
//#pragma GCC optimize(3)
//#pragma GCC optimize(4)
//#pragma GCC optimize("unroll-loops")
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include<bits/stdc++.h>
#define fi first
#define se second
#define db double
#define mp make_pair
#define pb push_back
#define pi acos(-1.0)
#define ll long long
#define vi vector<int>
#define mod 10000007
#define ld long double
#define C 0.5772156649
#define ls l,m,rt<<1
#define rs m+1,r,rt<<1|1
#define pll pair<ll,ll>
#define pil pair<int,ll>
#define pli pair<ll,int>
#define pii pair<int,int>
//#define cd complex<double>
#define ull unsigned long long
#define base 1000000000000000000
#define Max(a,b) ((a)>(b)?(a):(b))
#define Min(a,b) ((a)<(b)?(a):(b))
#define fin freopen("a.txt","r",stdin)
#define fout freopen("a.txt","w",stdout)
#define fio ios::sync_with_stdio(false);cin.tie(0)
template<typename T>
inline T const& MAX(T const &a,T const &b){return a>b?a:b;}
template<typename T>
inline T const& MIN(T const &a,T const &b){return a<b?a:b;}
inline void add(ll &a,ll b){a+=b;if(a>=mod)a-=mod;}
inline void sub(ll &a,ll b){a-=b;if(a<0)a+=mod;}
inline ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
inline ll qp(ll a,ll b){ll ans=1;while(b){if(b&1)ans=ans*a%mod;a=a*a%mod,b>>=1;}return ans;}
inline ll qp(ll a,ll b,ll c){ll ans=1;while(b){if(b&1)ans=ans*a%c;a=a*a%c,b>>=1;}return ans;}
using namespace std;
const double eps=1e-8;
const ll INF=0x3f3f3f3f3f3f3f3f;
const int N=500000+10,maxn=100000+10,inf=0x3f3f3f3f;
char s[N];
vi v[N];
struct PAM{
    int ch[N][26],fail[N],cnt[N],len[N],s[N],ans[N],res;
    int last,n,p;
    int newnode(int w)
    {
        for(int i=0;i<26;i++)ch[p][i] = 0;
        cnt[p] = 0;
        len[p] = w;
        return p++;
    }
    void init()
    {
        p = last = n = res=0;
        newnode(0);
        newnode(-1);
        s[n] = -1;
        fail[0] = 1;
    }
    int getfail(int x)
    {
        while(s[n-len[x]-1] != s[n]) x = fail[x];
        return x;
    }
    void add(int c)
    {
        s[++n] = c;
        int cur = getfail(last);
        if(!ch[cur][c]){
            int now = newnode(len[cur]+2);
            fail[now] = ch[getfail(fail[cur])][c];
            ch[cur][c] = now;
            v[fail[now]].pb(now);
        }
        last = ch[cur][c];
        cnt[last]++;
    }
    void dfs(int u)
    {
        ans[len[u]]++;
        if(len[u]%4==0&&ans[len[u]/2])res=max(res,len[u]);
        for(int i=0;i<v[u].size();i++)dfs(v[u][i]);
        ans[len[u]]--;
    }
}pam;
int main()
{
//    fin;
    pam.init();
    int n;scanf("%d%s",&n,s+1);
    for(int i=1;i<=n;i++)pam.add(s[i]-'a');
    pam.dfs(0);pam.dfs(1);
    printf("%d\n",pam.res);
    return 0;
}
/********************
********************/