HDU 5829 （NTT）

题目链接:点击这里

题意：定义f(k)为集合S中$\sum 所有子集前k大数的和$，求所有的k($1\leq k \leq n$).

从大到小排序，考虑第k个数的贡献$f_k$，那么有：
$f_k=\sum_{i=k}^{n}C_{i-1}^{k-1}*A_{i}*2^{n-i}=\frac{1}{2^{k}*(k-1)!}\sum_{i=0}^{n-k}\frac{(i+k-1)!}{i!}*2^{n-i}*A_{i+k}$
然后令：$g(i)=\frac{2^i}{(n-i)!}, h(i)=(i-1)!*A_i$,所以$f_k=\frac{1}{2^k*(k-1)!}\sum_{i=0}^{n-i}g(n-i)*h(i+k)$卷积就很显然了。

trick:输出的一行最后有空格。

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <time.h>
using namespace std;
#define maxn 500005
#define mod 998244353
#define G 3

long long x1[maxn], x2[maxn];

long long qpow (long long a, long long b) {    
    long long ret=1;    
    while (b) {    
        if (b&1) ret = (ret*a)%mod;    
        a = (a*a)%mod;    
        b >>= 1;    
    }    
    return ret;    
}    

void change (long long y[], int len) {
    for(int i = 1, j = len / 2; i < len - 1; i++) {
        if(i < j) swap(y[i], y[j]);
        int k = len / 2;
        while(j >= k) {
            j -= k;
            k /= 2;
        }
        if(j < k) j += k;
    }
}
void ntt(long long y[], int len, int on) {
    change (y, len);
    for(int h = 2; h <= len; h <<= 1) {
        long long wn = qpow(G, (mod-1)/h);
        if(on == -1) wn = qpow(wn, mod-2);
        for(int j = 0; j < len; j += h) {
            long long w = 1;
            for(int k = j; k < j + h / 2; k++) {
                long long u = y[k];
                long long t = w * y[k + h / 2] % mod;
                y[k] = (u + t) % mod;
                y[k+h/2] = (u - t + mod) % mod;
                w = w * wn % mod;
            }
        }
    }
    if(on == -1) {
        long long t = qpow (len, mod - 2);
        for(int i = 0; i < len; i++)
            y[i] = y[i] * t % mod;
    }
}

long long a[maxn], ans[maxn];
long long g[maxn], h[maxn];
long long fac[maxn], rev[maxn];
long long fac2[maxn], rev2[maxn];
int n;

void solve () {
    for (int x = 1; x <= n; x++) {
        g[x] = fac2[x]*rev[n-x] %mod;
        //if (x >= 1)
        h[x] = fac[x-1]*a[x] %mod;
    }
    int len = 1;
    while (len <= 2*n) len <<= 1;
    x1[0] = x2[0] = 0;
    for (int i = 1; i <= n; i++) {
        x1[i] = g[i];
        x2[i] = h[i];
    }
    for (int i = n+1; i <= len; i++) x1[i] = x2[i] = 0;
    ntt (x1, len, 1);
    ntt (x2, len, 1);
    for (int i = 0; i <= len; i++) x1[i] = x1[i]*x2[i]%mod;
    ntt (x1, len, -1);

    for (int i = n+1; i <= n*2; i++) ans[i-n] = x1[i];
    for (int i = 1; i <= n; i++) {
        long long tmp = rev2[i];
        ans[i] = ans[i]*tmp %mod *rev[i-1]%mod;
    }
    for (int i = 1; i <= n; i++) {
        ans[i] += ans[i-1], ans[i] %= mod;
        printf ("%lld ", ans[i]);
    }
    printf ("\n");
}

bool cmp (const long long &a, const long long &b) {
    return a > b;
}

int main () {
    fac[0] = 1, fac2[0] = 1;
    for (int i = 1; i <= 100000; i++) 
        fac[i] = fac[i-1] * i % mod, fac2[i] = fac2[i-1] * 2 %mod;
    rev[100000] = qpow (fac[100000], mod - 2);
    for (int i = 100000-1; i >= 0; i--) rev[i] = rev[i+1] * (i+1) % mod;
    for (int i = 0; i <= 100000; i++) rev2[i] = qpow (fac2[i], mod-2);
    int t;
    scanf ("%d", &t);
    while (t--) {
        scanf ("%d", &n);
        for (int i = 1; i <= n; i++) scanf ("%lld", &a[i]);
        sort (a+1, a+1+n, cmp);
        solve ();
    }
    return 0;
}