数学推导过程:
https://blog.csdn.net/yexiaohhjk/article/details/50229533
代码如下:
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cctype>
#include<queue>
using namespace std;
#define mem(a,b) memset(a,b,sizeof(a))
const int maxn=3e3+5;
double c[maxn];
int main()
{
int n;
while(~scanf("%d",&n))
{
double a0,a;
scanf("%lf%lf",&a0,&a);
for(int i=1;i<=n;i++) scanf("%lf",&c[i]);
double sum=0,ans,temp=n;
for(int i=1;i<=n;i++)
sum+=2*(n+1-i)*c[i];
ans=temp*a0+a-sum;
ans/=(temp+1);
printf("%.2lf\n",ans);
}
return 0;
}