题目大意:
按条件求职
令Ei=Fi/qi,求Ei.
n<=100000
思路:
化简,打表,手玩等,得到一个规律。
设Ai为qi,Bi为1/(i^2),Ei为
∑j<ia[j]∗b[i−j]−∑j>ia[j]∗b[j−i]
∑
j
<
i
a
[
j
]
∗
b
[
i
−
j
]
−
∑
j
>
i
a
[
j
]
∗
b
[
j
−
i
]
,前面是卷积,后面把a反过来也是卷积。fft!
程序:
#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<complex>
#define MAXN 500000
#define pi acos(-1)
using namespace std;
typedef complex<double> com;
int N,n,lg,rev[MAXN];
com a[MAXN],b[MAXN],c[MAXN],d[MAXN];
void bitrev(){
for (int i=0;i<N;i++) rev[i]=(rev[i>>1]>>1)|((i&1)<<(lg-1));
}
void fft(com *a,int f){
for (int i=0;i<N;i++) if (i<rev[i]) swap(a[i],a[rev[i]]);
for (int i=1;i<N;i<<=1){
com wn(cos(pi/i),f*sin(pi/i));
for (int j=0;j<N;j+=(i<<1)){
com w(1,0);
for (int k=0;k<i;k++){
com u=a[j+k],v=w*a[j+k+i];
a[j+k]=u+v; a[j+k+i]=u-v;
w*=wn;
}
}
}
if (f==-1) for (int i=0;i<N;i++) a[i]/=N;
}
int main(){
scanf("%d",&n);
for (N=1;N<=n*2;N<<=1,lg++);
for (int i=1;i<=n;i++){
double x;
scanf("%lf",&x);
a[i]=c[n-i+1]=x; b[i]=d[i]=(double)1.0*1/i/i;
}
bitrev();
fft(a,1); fft(b,1);
for (int i=0;i<N;i++) a[i]=a[i]*b[i];
fft(a,-1);
fft(c,1);
for (int i=0;i<N;i++) c[i]=c[i]*b[i];
fft(c,-1);
for (int i=1;i<=n;i++) printf("%.3lf\n",a[i].real()-c[n-i+1].real());
}