Problem
题意:
给定数列
{qi}
{
q
i
}
,求数列
{Ei}
{
E
i
}
,其中满足关系式:
Solution
很明显先两式合并
然后发现式子比较偏向于 FFT F F T 或 NTT N T T 解决,设 f[i]=qi,g[i]=1i2 f [ i ] = q i , g [ i ] = 1 i 2
则式子:
左边直接卷积,右边继续变形:
↑(第一步换元,第二步考虑 g[0]=0 g [ 0 ] = 0 )↑
希望变成 FFT F F T 套路式:
↑(同时加上 n−i−2∗j n − i − 2 ∗ j )↑
将 n−i n − i 看做整体,令 F[j]=F[n−j] F [ j ] = F [ n − j ]
则式子为:
↑(也可以卷积了)↑
Code
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rg register
#define cl(x) memset(x,0,sizeof(x))
#define max(x,y) ((x)>(y)?(x):(y))
#define min(x,y) ((x)<(y)?(x):(y))
#define abs(x) ((x)>0?(x):(-(x)))
#define pi (3.14159265358979323846)
template <typename _Tp> inline _Tp read(_Tp&x){
rg char c11=getchar(),ob=0;x=0;
while(c11^'-'&&!isdigit(c11))c11=getchar();if(c11=='-')c11=getchar(),ob=1;
while(isdigit(c11))x=x*10+c11-'0',c11=getchar();if(ob)x=-x;return x;
}
const int N=300100;
double c[N],f[N];
int rev[N];
int len(0),n,nn;
struct cpx{
double r,i;
cpx(){}
cpx(double R,double I){r=R,i=I;}
cpx operator + (const cpx&x) const {return cpx(r+x.r,i+x.i);}
cpx operator - (const cpx&x) const {return cpx(r-x.r,i-x.i);}
cpx operator * (const cpx&x) const {return cpx(r*x.r-i*x.i,r*x.i+i*x.r);}
void operator *= (const cpx&x) {*this=*this*x;}
}a[N],b[N];
void fft(cpx *a,int opt){
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){
cpx wn=cpx(cos(pi/i),opt*sin(pi/i));
for(rg int j=0;j<n;j+=(i<<1)){
cpx w(1,0);
for(rg int k=0;k<i;++k,w*=wn){
cpx x=a[j+k],y=w*a[j+k+i];
a[j+k]=x+y,a[j+k+i]=x-y;
}
}
}
if(opt==-1)for(int i=0;i<n;++i)a[i].r/=(double)n;
return ;
}
void FFT(){
fft(a,1);fft(b,1);
for(rg int i=0;i<n;++i)a[i]*=b[i];
fft(a,-1);return ;
}
int main(){
read(nn);
for(rg int i=1;i<=nn;++i){
scanf("%lf",&f[i]);a[i].r=f[i];
b[i].r=(double)1/(double)i/(double)i;
}
for(n=1;n<nn+nn;n<<=1)++len;
for(rg int i=0;i<n;++i)rev[i]=(rev[i>>1]>>1)|((i&1)<<(len-1));
FFT();for(rg int i=1;i<=nn;++i)c[i]=a[i].r;
for(rg int i=0;i<n;++i)a[i]=b[i]=cpx(0,0);
for(rg int i=1;i<=nn;++i)
a[i]=cpx(f[nn-i+1],0),b[i]=cpx((double)1.0/(double)i/(double)i,0);
FFT();for(rg int i=1;i<=nn;++i)c[i]-=a[nn-i+1].r;
for(rg int i=1;i<=nn;++i)printf("%.8lf\n",c[i]);
return 0;
}