Time Limit: 30 Sec
Memory Limit: 256 MB
Description
给出n个数qi,给出Fj的定义如下:
F
j
=
∑
i
=
1
j
−
1
q
i
×
q
j
(
i
−
j
)
2
−
∑
i
=
j
+
1
n
q
i
×
q
j
(
i
−
j
)
2
F_j~=~\sum_{i = 1}^{j - 1} \frac{q_i \times q_j}{(i - j)^2}~-~\sum_{i = j + 1}^{n} \frac{q_i \times q_j}{(i - j)^2}
Fj = i=1∑j−1(i−j)2qi×qj − i=j+1∑n(i−j)2qi×qj
E
i
=
F
i
q
i
E_i~=~\frac{F_i}{q_i}
Ei = qiFi
令Ei=Fi/qi,求Ei.
Input
第一行一个整数n。
接下来n行每行输入一个数,第i行表示qi。
n≤100000,0<qi<1000000000
Output
n行,第i行输出Ei。与标准答案误差不超过1e-2即可。
题目分析
E i = F i q i = ∑ j < i q j ( i − j ) 2 − ∑ j > i q j ( j − i ) 2 E_i=\frac{F_i}{q_i}=\sum_{j<i}\frac{q_j}{(i-j)^2}-\sum_{j>i}\frac{q_j}{(j-i)^2} Ei=qiFi=∑j<i(i−j)2qj−∑j>i(j−i)2qj
设
A
(
i
)
=
q
i
,
C
(
i
)
=
1
i
2
A(i)=q_i,C(i)=\frac{1}{i^2}
A(i)=qi,C(i)=i21
则有
E
i
=
∑
j
=
1
i
−
1
A
(
j
)
∗
C
(
i
−
j
)
−
∑
j
=
i
+
1
n
A
(
j
)
C
(
j
−
i
)
E_i=\sum_{j=1}^{i-1}A(j)*C(i-j)-\sum_{j=i+1}^nA(j)C(j-i)
Ei=∑j=1i−1A(j)∗C(i−j)−∑j=i+1nA(j)C(j−i)
令
A
(
0
)
=
C
(
0
)
=
0
A(0)=C(0)=0
A(0)=C(0)=0
则
E
i
=
∑
j
=
0
i
A
(
j
)
∗
C
(
i
−
j
)
−
∑
j
=
i
n
A
(
j
)
C
(
j
−
i
)
=
∑
j
=
0
i
A
(
j
)
∗
C
(
i
−
j
)
−
∑
j
=
0
n
−
i
A
(
j
+
i
)
C
(
j
)
E_i=\sum_{j=0}^{i}A(j)*C(i-j)-\sum_{j=i}^nA(j)C(j-i)=\sum_{j=0}^{i}A(j)*C(i-j)-\sum_{j=0}^{n-i}A(j+i)C(j)
Ei=∑j=0iA(j)∗C(i−j)−∑j=inA(j)C(j−i)=∑j=0iA(j)∗C(i−j)−∑j=0n−iA(j+i)C(j)
设 B ( x ) = A ( n − x ) B(x)=A(n-x) B(x)=A(n−x),则 E i = ∑ j = 0 i A ( j ) ∗ C ( i − j ) − ∑ j = 0 n − i C ( j ) B ( n − j − i ) E_i=\sum_{j=0}^{i}A(j)*C(i-j)-\sum_{j=0}^{n-i}C(j)B(n-j-i) Ei=∑j=0iA(j)∗C(i−j)−∑j=0n−iC(j)B(n−j−i)
此时发现这个式子两部分都是卷积形式,故FFT优化即可
#include<iostream>
#include<cmath>
#include<algorithm>
#include<map>
#include<cstring>
#include<cstdio>
using namespace std;
typedef long long lt;
typedef double dd;
int read()
{
int f=1,x=0;
char ss=getchar();
while(ss<'0'||ss>'9'){if(ss=='-')f=-1;ss=getchar();}
while(ss>='0'&&ss<='9'){x=x*10+ss-'0';ss=getchar();}
return f*x;
}
const dd Pi=acos(-1.0);
const int maxn=400010;
int n,m;
struct complex{
dd x,y;
complex(dd _x=0,dd _y=0){ x=_x; y=_y;}
}A[maxn],B[maxn],C[maxn];
int lim=1,L,R[maxn];
complex operator +(complex a,complex b){ return complex( a.x+b.x, a.y+b.y);}
complex operator -(complex a,complex b){ return complex( a.x-b.x, a.y-b.y);}
complex operator *(complex a,complex b){ return complex( a.x*b.x-a.y*b.y, a.x*b.y+a.y*b.x);}
void FFT(complex* a,int opt)
{
for(int i=0;i<lim;++i)
if(i<R[i]) swap(a[i],a[R[i]]);
for(int i=1;i<lim;i<<=1)
{
complex wn(cos(Pi/i),opt*sin(Pi/i));
for(int j=0;j<lim;j+=(i<<1))
{
complex w(1,0);
for(int k=0;k<i;++k)
{
complex nx=a[j+k],ny=w*a[i+j+k];
a[j+k]=nx+ny;
a[i+j+k]=nx-ny;
w=w*wn;
}
}
}
}
int main()
{
n=read();
for(int i=1;i<=n;++i)
{
scanf("%lf",&A[i].x);
B[n-i].x=A[i].x;
C[i].x=1.0/(dd)i/(dd)i;
}
while(lim<=(n<<1)) lim<<=1,L++;
for(int i=0;i<lim;++i)
R[i]=(R[i>>1]>>1)|((i&1)<<(L-1));
FFT(A,1); FFT(B,1); FFT(C,1);
for(int i=0;i<=lim;++i)
A[i]=A[i]*C[i],B[i]=B[i]*C[i];
FFT(A,-1); FFT(B,-1);
for(int i=1;i<=n;++i)
printf("%.3lf\n",(A[i].x-B[n-i].x)/(dd)lim);
return 0;
}