思路:
我们把所有的值从0开始读入。
题目要求的式子是:
Ei=∑j=0i−1pj(i−j)2−∑j=i+1n−1pj(j−i)2
我们令
f(x)=px
,
g(x)=1i2
,然后等式中右边的两项是独立的,我们分开考虑。
左边的:
F1(i)=∑j=0i−1f(j)g(i−j)
所以说做完
FFT
之后,
F1(x)=R[x]
。
右边的:
F2(i)=∑j=i+1n−1f(j)g(j−i)
让
j
值减小
F2(i)=∑j=0n−i−2f(j+i+1)g(j+1)
我们把
f
取反,变为
F2(i)=∑j=0n−i−2rf(n−i−2−j)g(j+1)
所以说做完
FFT
之后,
F2(x)=R[n−x−1]
。
最后输出答案即可。
代码:
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
const int maxn = 100010*3;
const double pi = acos(-1);
int Bit, rx[maxn];
struct Com{
double x, y;
Com(double X = 0, double Y = 0){x = X, y = Y;}
Com(const Com &t){x = t.x, y = t.y;}
Com operator + (const Com &t) const{return Com(x+t.x, y+t.y);}
Com operator - (const Com &t) const{return Com(x-t.x, y-t.y);}
Com operator * (const Com &t) const{return Com(x*t.x-y*t.y, x*t.y+t.x*y);}
};
void fft(Com *A, int n, int f){
if(rx[n-1] != n-1) for(int i = 0; i < n; i ++) rx[i] = (rx[i>>1]>>1) | ((i&1)<<(Bit-1));
for(int i = 0; i < n; i ++) if(i < rx[i]) swap(A[i], A[rx[i]]);
for(int i = 1; i < n; i <<= 1){
const Com Base(cos(pi/i), f*sin(pi/i));
for(int j = 0; j < n; j += (i<<1)){
Com mi(1, 0);
for(int k = 0; k < i; k ++, mi = mi * Base){
Com x = A[j+k], y = A[i+j+k] * mi;
A[j+k] = x+y, A[i+j+k] = x-y;
}
}
}
if(f == -1) for(int i = 0; i < n; i ++) A[i].x /= n;
}
int n, e, m;
Com a[maxn], b[maxn], c[maxn];
double v[maxn];
int main(){
scanf("%d", &n), n --;
for(int i = 0; i <= n; i ++) scanf("%lf", &v[i]);
for(int i = 0; i <= n; i ++) a[i].x = v[i];
for(int i = 1; i <= n; i ++) b[i].x = (1.0/i/i);
for(int i = 0; i <= n; i ++) c[i].x = v[n-i];
m = 2*n; for(n = 1; n <= m; n <<= 1, Bit ++);
fft(a, n, 1), fft(b, n, 1), fft(c, n, 1);
for(int i = 0; i < n; i ++) a[i] = a[i] * b[i];
for(int i = 0; i < n; i ++) b[i] = b[i] * c[i];
fft(a, n, -1), fft(b, n, -1);
for(int i = 0; i <= m/2; i ++) printf("%.10lf\n", a[i].x - b[m/2-i].x);
return 0;
}