3527: [Zjoi2014]力
Time Limit: 30 Sec Memory Limit: 256 MBSec Special JudgeSubmit: 2653 Solved: 1608
[Submit][Status][Discuss]
Description
给出n个数qi,给出Fj的定义如下:
令Ei=Fi/qi,求Ei.
Input
第一行一个整数n。
接下来n行每行输入一个数,第i行表示qi。
n≤100000,0<qi<1000000000
Output
n行,第i行输出Ei。与标准答案误差不超过1e-2即可。
Sample Input
5
4006373.885184
15375036.435759
1717456.469144
8514941.004912
1410681.345880
4006373.885184
15375036.435759
1717456.469144
8514941.004912
1410681.345880
Sample Output
-16838672.693
3439.793
7509018.566
4595686.886
10903040.872
3439.793
7509018.566
4595686.886
10903040.872
先把 Ei=Fi/qi 里的 qi 直接拿掉
之后 Ei=sigma(bulabula)-sigma(lalalala)
分开搞
形式大概是 qi/(i-j)^2
所以 就把下面倒过来 搞一遍卷积就好了
两部分长一个模子 同样的方法再把另一边也搞了就好
#include<cmath>
#include<ctime>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#include<iomanip>
#include<vector>
#include<string>
#include<bitset>
#include<queue>
#include<set>
#include<map>
using namespace std;
typedef double db;
inline int read()
{
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch<='9'&&ch>='0'){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
void print(int x)
{if(x<0)putchar('-'),x=-x;if(x>=10)print(x/10);putchar(x%10+'0');}
const int N=300100;
const db pi=acos(-1);
struct cp
{
db real,image;
friend cp operator +(const cp &x,const cp &y)
{return (cp){x.real+y.real,x.image+y.image};}
friend cp operator -(const cp &x,const cp &y)
{return (cp){x.real-y.real,x.image-y.image};}
friend cp operator *(const cp &x,const cp &y)
{return (cp){x.real*y.real-x.image*y.image,x.real*y.image+x.image*y.real};}
}A[N],B[N],C[N];
int r[N];
void fft(cp *x,int lim,int opt)
{
register int i,j,k,m;
for(i=0;i<lim;++i)
if(r[i]<i)
swap(x[i],x[r[i]]);
for(m=2;m<=lim;m<<=1)
{
k=m>>1;
cp wn((cp){cos(2*pi*opt/m),sin(2*pi*opt/m)});
for(i=0;i<lim;i+=m)
{
cp w((cp){1,0}),tmp;
for(j=0;j<k;++j,w=w*wn)
{
tmp=x[i+j+k]*w;
x[i+j+k]=x[i+j]-tmp;
x[i+j]=x[i+j]+tmp;
}
}
}
if(opt==-1)
for(i=0;i<lim;++i)
x[i].real/=lim;
}
db q[N],E[N];
int main()
{
register int i,lim(1);
int n=read();
for(i=1;i<=n;++i) scanf("%lf",&q[i]);
while(lim<=(n<<1)) lim<<=1;
for(i=0;i<lim;++i) r[i]=(i&1)*(lim>>1)+(r[i>>1]>>1);
for(i=1;i<=n;++i)
A[i].real=q[i],
B[n-i+1].real=-1.0/(1ll*i*i);
fft(A,lim,1);fft(B,lim,1);
for(i=0;i<lim;++i) C[i]=A[i]*B[i];
fft(C,lim,-1);
for(i=1;i<n;++i) E[i]=C[i+1+n].real;
memset(A,0,sizeof(A));
memset(B,0,sizeof(B));
for(i=1;i<=n;++i)
A[n-i+1].real=q[i],
B[n-i+1].real=1.0/(1ll*i*i);
fft(A,lim,1);fft(B,lim,1);
for(i=0;i<lim;++i) C[i]=A[i]*B[i];
fft(C,lim,-1);
for(i=2;i<=n;++i) E[i]+=C[((n+1)<<1)-i].real;
for(i=1;i<=n;++i) printf("%.3lf\n",E[i]);
return 0;
}