bzoj3527: [Zjoi2014]力

只想贴个模板QAQ。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
int read()
{
    char ch=getchar();int f=0;
    while(ch<'0'||ch>'9')ch=getchar();
    while(ch>='0'&&ch<='9'){f=(f<<1)+(f<<3)+ch-'0';ch=getchar();}
    return f;
}
struct cp
{
    double x,y;
    cp(double X=0,double Y=0)
    {
        x=X;y=Y;
    }
}a[300005],b[300005];
double ans1[300005],ans2[300005];
int r[300005],L;
cp operator +(cp a,cp b) {return cp(a.x+b.x,a.y+b.y);}
cp operator -(cp a,cp b){return cp(a.x-b.x,a.y-b.y);}
cp operator *(cp a,cp b) {return cp(a.x*b.x-a.y*b.y,a.x*b.y+a.y*b.x);}
int n,lim,MX;
double q[300005],q2[300005],g[300005];
void pre()
{
    lim=MX=n;MX<<=1;
    for(lim=1;lim<=MX;lim<<=1) L++;
    for(int i=0;i<=lim;i++)
    {
        r[i]=((r[i>>1]>>1)|(i&1)<<(L-1));
    }
}
void fft(cp *a,int n,int flag)
{
    for(int i=0;i<n;i++)
    if(r[i]>i) swap(a[i],a[r[i]]);
    for(int i=1;i<n;i<<=1)
    {
        cp w_n(cos(M_PI/i),flag*sin(M_PI/i));
        for(int j=0;j<n;j+=i<<1)
        {
            cp w(1,0);
            for(int k=0;k<i;k++)
            {
                cp x=a[j+k],y=w*a[j+k+i];
                a[j+k]=x+y,a[j+k+i]=x-y;
                w=w*w_n;
            }
        }
    }
}
int main()
{
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
    {
        scanf("%lf",&q[i]);
        q2[n-i]=q[i];
        g[i]=1/(double)((double)i*i);
    }
    for(int i=1;i<=n;i++)
    a[i].x=q[i],b[i].x=g[i];
    pre();
    fft(a,lim,1),fft(b,lim,1);
    for(int i=0;i<lim;i++)
    a[i]=a[i]*b[i];
    fft(a,lim,-1);
    for(int i=0;i<lim;i++)
    ans1[i]=a[i].x/lim;

    memset(a,0,sizeof(a)),memset(b,0,sizeof(b));

    for(int i=0;i<=n;i++)
    a[i]=cp(q2[i],0),b[i]=cp(g[i],0);

    fft(a,lim,1),fft(b,lim,1);
    for(int i=0;i<lim;i++)
    a[i]=a[i]*b[i];
    fft(a,lim,-1);
    for(int i=0;i<lim;i++)
    ans2[i]=a[i].x/lim;

    for(int i=1;i<=n;i++)
    printf("%lf\n",ans1[i]-ans2[n-i]);
}