bzoj3527 [Zjoi2014]力

//It is made by wfj_2048~
#include <algorithm>
#include <iostream>
#include <complex>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <vector>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <set>
#define inf (1<<30)
#define pi acos(-1)
#define NN (500010)
#define il inline
#define RG register
#define ll long long
#define C complex<double>
 
using namespace std;
 
int rev[NN],n,N,M,lg;
double q[NN],ans[NN];
C a[NN],b[NN],c[NN];
 
il void FFT(C *a,RG int n,RG int f){
    for (RG int i=0;i<n;++i) if (i<rev[i]) swap(a[i],a[rev[i]]);
    for (RG int i=1;i<n;i<<=1){
    C wn(cos(pi/i),sin(f*pi/i)),x,y;
    for (RG int j=0;j<n;j+=(i<<1)){
        C w(1,0);
        for (RG int k=0;k<i;++k,w*=wn){
        x=a[j+k],y=w*a[j+k+i];
        a[j+k]=x+y,a[j+k+i]=x-y;
        }
    }
    }
    return;
}
 
il void work(){
    scanf("%d",&n); for (RG int i=1;i<=n;++i) scanf("%lf",&q[i]); for (RG int i=1;i<=n;++i) a[i]=q[i];
    for (RG int i=1;i<=n;++i) b[i]=1.0/i/i; M=2*(n+1); for (N=1;N<=M;N<<=1) lg++;
    for (RG int i=0;i<=N;++i) rev[i]=(rev[i>>1]>>1)|((i&1)<<(lg-1)); FFT(a,N,1),FFT(b,N,1);
    for (RG int i=0;i<N;++i) a[i]*=b[i]; FFT(a,N,-1);
    for (RG int i=1;i<=n;++i) c[i]=q[n-i+1]; FFT(c,N,1);
    for (RG int i=0;i<N;++i) c[i]*=b[i]; FFT(c,N,-1);
    for (RG int i=1;i<=n;++i) ans[i]=a[i].real()/N-c[n-i+1].real()/N;
    for (RG int i=1;i<=n;++i) printf("%0.3lf\n",ans[i]); return;
}
 
int main(){
    work();
    return 0;
}