题目:
题解:
关键在于构造卷积
Ei=∑i>jqj(i−j)2−∑i<jqj(i−j)2
E
i
=
∑
i
>
j
q
j
(
i
−
j
)
2
−
∑
i
<
j
q
j
(
i
−
j
)
2
这个平方在分母上好蠢啊
设 gi=1i2 g i = 1 i 2
Ei=∑i>jqjgi−j−∑i<jqjgj−i
E
i
=
∑
i
>
j
q
j
g
i
−
j
−
∑
i
<
j
q
j
g
j
−
i
这前面的分明是个卷积啊,后面的也可以通过倒置q数组解决
但是有一个问题,我们求的卷积形式是
ck=∑kj=0ajbk−j
c
k
=
∑
j
=
0
k
a
j
b
k
−
j
但是因为这道题b不能取到0,即j循环到k-1,怎么办呢?其实解决还是很好解决的,只要让g[0]=0,这样不管j=k有几项都是0
最后吐槽的就是精度了,必须这样写才能A
1/((double)i*(double)i)
代码:
#include <cstdio>
#include <cmath>
#include <iostream>
using namespace std;
const double pi=acos(-1.0);
const int N=300005;
struct complex
{
double x,y;
complex(double X=0,double Y=0){x=X;y=Y;}
}q1[N],q2[N],g1[N],g2[N];int n,r[N],fn;double x[N],p[N],q[N];
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.y*b.x+a.x*b.y);}
void FFT(complex *a,int id)
{
for (int i=0;i<n;i++)
if (i<r[i]) swap(a[i],a[r[i]]);
for (int k=1;k<n;k<<=1)
{
complex wn=complex(cos(pi/k),id*sin(pi/k));
for (int i=0;i<n;i+=(k<<1))
{
complex w=complex(1,0);
for (int j=0;j<k;j++,w=w*wn)
{
complex x=a[i+j],y=w*a[i+j+k];
a[i+j]=x+y; a[i+j+k]=x-y;
}
}
}
}
int main()
{
scanf("%d",&fn);
for (int i=1;i<=fn;i++) scanf("%lf",&q1[i].x),x[i]=q1[i].x,g1[i].x=1/((double)i*(double)i),g2[i].x=g1[i].x;
fn*=2;int L=0;
for (n=1;n<=fn;n<<=1) L++;
for (int i=0;i<n;i++)
r[i]=(r[i>>1]>>1)|((i&1)<<L-1);
FFT(q1,1); FFT(g1,1);
for (int i=0;i<n;i++) q1[i]=q1[i]*g1[i];
FFT(q1,-1);
for (int i=0;i<=n;++i) p[i]=q1[i].x/n;
fn/=2;
for (int i=1;i<=fn;i++) q2[i].x=x[fn-i+1];
FFT(q2,1); FFT(g2,1);
for (int i=0;i<n;i++) q2[i]=q2[i]*g2[i];
FFT(q2,-1);
for (int i=0;i<=n;++i) q[i]=q2[i].x/n;
for (int i=1;i<=fn;i++) printf("%.6lf\n",p[i]-q[fn-i+1]);
}