hdu5530

分治ntt

考虑从添加i，放在j位置，那么1->j是一个连通块，j+1->i和1->j不连通，那么我们可以列出式子dp[i]=∑j=1->i dp[i-j]*A(i-1,j-1)*j^2

dp[i]表示i个数的答案

然后化简一下就可以分治ntt了

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 3e5 + , P = ;
int n, k;
ll a[N], b[N], fac[N], inv[N], facinv[N], dp[N];
ll power(ll x, ll t)
{
    ll ret = ;
    for(; t; t >>= , x = x * x % P) if(t & ) ret = ret * x % P;
    return ret;
}
void ntt(ll *a, int f)
{
    for(int i = ; i < n; ++i)
    {
        int t = ;
        for(int j = ; j < k; ++j) if(i >> j & ) t |=  << (k - j - );
        if(i < t) swap(a[i], a[t]);
    }
    for(int l = ; l <= n; l <<= )
    {
        ll w = power(, f ==  ? (P - ) / l : P -  - (P - ) / l);
        int m = l >> ;
        for(int i = ; i < n; i += l)
        {
            ll t = ;
            for(int k = ; k < m; ++k, t = t * w % P)
            {
                ll x = a[i + k], y = t * a[i + m + k];
                a[i + k] = (x + y) % P;
                a[i + m + k] = ((x - y) % P + P) % P;
            }
        }
    }
    if(f == -)
    {
        ll inv = power(n, P - );
        for(int i = ; i < n; ++i) a[i] = a[i] * inv % P;
    }
}
void cdq(int l, int r)
{
    if(l == r) return;
    int mid = (l + r) >> ;
    cdq(l, mid);
    n = ;
    k = ;
    while(n <= r - l + ) n <<= , ++k;
    for(int i = ; i < n; ++i) a[i] = b[i] = ;
    for(int i = l; i <= mid; ++i) a[i - l] = dp[i] * facinv[i] % P;
    for(int i = ; i <= r - l; ++i) b[i] = (ll)i * i % P;
    ntt(a, );
    ntt(b, );
    for(int i = ; i < n; ++i) a[i] = a[i] * b[i] % P;
    ntt(a, -);
    for(int i = mid + ; i <= r; ++i) dp[i] = (dp[i] + a[i - l] * fac[i - ] % P) % P;
    cdq(mid + , r);
}
int main()
{
    inv[] = inv[] = facinv[] = fac[] = ;
    for(int i = ; i < N; ++i)
    {
        if(i != ) inv[i] = (P - P / i) * inv[P % i] % P;
        facinv[i] = facinv[i - ] * inv[i] % P;
        fac[i] = fac[i - ] * i % P;
    }
    dp[] = ;
    cdq(, );
    while(scanf("%d", &n) != EOF)
    {

        printf("%lld\n", dp[n]);
    }
    return ;
}