题意
给出n个数qi,给出Fj的定义如下:
令
Ei=Fi/qi
,求
Ei
.
n≤100000,0<qi<1000000000
题解
FFT的简单运用。
Ej=∑i=1j−1qi(i−j)2−∑i=j+1nqi(i−j)2
设 gi=1i2 ,得:
Ej=∑i=1j−1qi∗gj−i−∑i=j+1nqi∗gi−j
左边已经很接近卷积形式了,如果把q存到0~n-1,设 q′i=qi+1 ,则
=∑i=1j−1q′i−1∗gj−i=∑i=0j−1q′i∗gj−1−i
直接FFT就好了。
对于右边,其实把q反过来在搞就行了:
设 q′′i=qn−i ,
∑i=j+1nqi∗gi−j=∑k=1n−jqj+k∗gk=∑k=1n−jq′′n−j−k∗gk
同样FFT搞即可。
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
using namespace std;
const double PI=acos(-1);
const int maxn=1<<20;
struct E{
double real,imag;
E(double real=0,double imag=0):real(real),imag(imag){}
void operator /=(double x){ real/=x; imag/=x; }
};
E operator + (E &a,E &b){ return E(a.real+b.real,a.imag+b.imag); }
E operator - (E &a,E &b){ return E(a.real-b.real,a.imag-b.imag); }
E operator * (E &a,E &b){ return E(a.real*b.real-a.imag*b.imag,a.imag*b.real+a.real*b.imag); }
const double eps=1e-9;
int dcmp(double x){
if(fabs(x)<eps) return 0;
return x>0?1:-1;
}
int rev[maxn];
void get_rev(int n){
rev[0]=0; int log2n=log2(n);
for(int i=1;i<=n-1;i++) rev[i]=(rev[i>>1]>>1)|((i&1)<<(log2n-1));
}
struct Complex_Line{
int n; E a[maxn];
void Clear(){ n=0; memset(a,0,sizeof(a)); }
void FFT(int _k){
get_rev(n); for(int i=0;i<=n-1;i++) if (i<rev[i]) swap(a[i],a[rev[i]]);
for(int m=2;m<=n;m<<=1){
E wm(cos(2*PI/m),_k*sin(2*PI/m));
for(int k=0;k<n-1;k+=m){
E w(1,0),t0,t1;
for(int j=0;j<=m/2-1;j++,w=w*wm) t0=a[k+j], t1=w*a[k+j+m/2], a[k+j]=t0+t1, a[k+j+m/2]=t0-t1;
}
}
if(_k==-1) for(int i=0;i<=n;i++) a[i]/=n;
}
} q,g,f1,f2;
int n;
double tmp[maxn];
int main(){
freopen("bzoj3527.in","r",stdin);
freopen("bzoj3527.out","w",stdout);
scanf("%d",&n);
for(int i=1;i<=n;i++) scanf("%lf",&tmp[i]);
int _n; for(_n=1;_n<n;_n<<=1); _n<<=1;
q.n=_n; for(int i=0;i<=n-1;i++) q.a[i]=E(tmp[i+1],0);
g.n=_n; for(int i=1;i<=n-1;i++) g.a[i]=E(1.0/i/i,0);
q.FFT(1); g.FFT(1);
f1.n=_n; for(int i=0;i<=_n-1;i++) f1.a[i]=q.a[i]*g.a[i];
f1.FFT(-1);
q.Clear(); q.n=_n; for(int i=0;i<=n-1;i++) q.a[i]=E(tmp[n-i],0);
g.Clear(); g.n=_n; for(int i=1;i<=n-1;i++) g.a[i]=E(1.0/i/i,0);
q.FFT(1); g.FFT(1);
f2.n=_n; for(int i=0;i<=_n-1;i++) f2.a[i]=q.a[i]*g.a[i];
f2.FFT(-1);
for(int i=0;i<=n-1;i++) printf("%.7lf\n",f1.a[i].real-f2.a[n-i-1].real);
return 0;
}