Description
给出
n
个数
Fj=∑i<jqi(i−j)2−∑i>jqi(i−j)2
试求 F
Analysis
求和式减号前后两部分非常相似,只考虑求前者
Fi=∑j<iqj(i−j)2=∑j<iqjri−j
其中 ri=1i2
这个显然是卷积形式,可以用FFT优化到 O(nlogn)
Code
#include<cmath>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define fd(i,b,a) for(int i=b;i>=a;i--)
#define efo(i,v,u) for(int i=last[v],u=to[i];i;i=next[i],u=to[i])
#define max(x,y) ((x)>(y)?(x):(y))
#define min(x,y) ((x)<(y)?(x):(y))
#define mset(a,x) memset(a,x,sizeof(a))
using namespace std;
typedef long long ll;
typedef double db;
const int N=4e5+5;
const db pi=acos(-1);
int n;
struct Z
{
db x,y;
Z(db xx=0,db yy=0){x=xx,y=yy;}
friend Z operator +(Z a,Z b){return Z(a.x+b.x,a.y+b.y);}
friend Z operator -(Z a,Z b){return Z(a.x-b.x,a.y-b.y);}
friend Z operator *(Z a,Z b){return Z(a.x*b.x-a.y*b.y,a.x*b.y+a.y*b.x);}
}A[N],B[N],C[N],t[N];
db a[N],b[N],c[N],d[N];
int lg;
void dft(Z *a,int n,int sig=1)
{
fo(i,0,n-1)
{
int p=0;
for(int j=i,k=1;k<=lg;k++,j>>=1) p=(p<<1)+(j&1);
t[p]=a[i];
}
for(int i=2;i<=n;i<<=1)
{
Z wi=Z(cos(sig*2*pi/i),sin(sig*2*pi/i));
for(int j=0;j<n;j+=i)
{
Z w=Z(1,0);
for(int k=j;k<j+(i>>1);k++)
{
Z u=t[k],v=t[k+(i>>1)]*w;
t[k]=u+v,t[k+(i>>1)]=u-v;
w=w*wi;
}
}
}
fo(i,0,n-1) a[i]=t[i];
if(sig==-1) fo(i,0,n-1) a[i].x/=n;
}
void fft(db *c,db *a,db *b)
{
for(lg=0;(1<<lg)<=(n<<1);lg++);
fo(i,0,(1<<lg)-1) A[i]=Z(a[i],0),B[i]=Z(b[i],0);
dft(A,1<<lg);dft(B,1<<lg);
fo(i,0,(1<<lg)-1) C[i]=A[i]*B[i];
dft(C,1<<lg,-1);
fo(i,0,n) c[i]=C[i].x;
}
int main()
{
scanf("%d",&n);
fo(i,1,n) scanf("%lf",&a[i]);
fo(i,1,n) b[i]=1.0/i/i;
fft(c,a,b);
fo(i,0,n/2) swap(a[i],a[n-i]);
fft(d,a,b);
fo(i,0,n/2) swap(d[i],d[n-i]);
fo(i,1,n) printf("%.3lf\n",c[i]-d[i]);
return 0;
}