标签:FFT
给出n个数qi,给出Fj的定义如下:
令Ei=Fi/qi,求Ei.
n<=100000
我们发现,直接暴力算复杂度为 O(n2) ,常数还很大,注意到
Ei=∑i<jqj(i−j)2−∑i>jqj(i−j)2
算上i=j的情况,刚好是有n项,并且每一项的系数有规律,考虑两个多项式:
S=q1∗x0+q2∗x1+...+an∗xn−1
T=−1(n−1)2∗x0−1(n−2)2∗x1−...−0∗xn−1+1∗xn+122∗xn+1+...+1(n−1)2∗x2n−1
将两个多项式相乘,第n到第2n-1项即为答案。这是一个卷积的形式,用FFT加速即可。
/**************************************************************
Problem: 3527
User: P1atform
Language: C++
Result: Accepted
Time:3464 ms
Memory:53948 kb
****************************************************************/
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#define pi acos(-1.0)
#define N 800050
using namespace std;
int n,m,l=0,r[N],nn;
struct com
{
double x,y;
inline com operator +(com b) {com ret;ret.x=x+b.x,ret.y=y+b.y;return ret;}
inline com operator -(com b) {com ret;ret.x=x-b.x,ret.y=y-b.y;return ret;}
inline com operator *(com b) {com ret;ret.x=x*b.x-y*b.y,ret.y=y*b.x+x*b.y;return ret;}
}s[N*2],t[N*2];
inline void fft(com a[],int k)
{
for (int i=0;i<n;i++) if (i<r[i]) swap(a[i],a[r[i]]);
for (int i=1;i<n;i<<=1)
{
com w,wn,X,Y;
wn.x=cos(pi/i),wn.y=k*sin(pi/i);
for (int j=0;j<n;j+=(i<<1))
{
w.x=1,w.y=0;
for (int _=0;_<i;_++,w=w*wn)
{
X=a[j+_],Y=w*a[j+_+i];
a[j+_]=X+Y,a[j+_+i]=X-Y;
}
}
}
if (k==-1) for (int i=0;i<n;i++) a[i].x/=n;
}
int main()
{
scanf("%d",&n);
for (int i=0;i<n;i++) scanf("%lf",&s[i].x);
for (int i=0;i<n-1;i++) t[i].x=-1.0/(n-i-1)/(n-i-1);
for (int i=n;i<2*n-1;i++) t[i].x=1.0/(i-n+1)/(i-n+1);
for (nn=n,m=3*n,n=1;n<=m;n<<=1) l++;
for (int i=0;i<n;i++) r[i]=(r[i>>1]>>1)|((i&1)<<(l-1));
fft(s,1),fft(t,1);
for (int i=0;i<n;i++) s[i]=s[i]*t[i];
fft(s,-1);
for (int i=nn-1;i<2*nn-1;i++) printf("%.9lf\n",s[i].x);
}