UVA-10014

Posted 2021-02-18 morrowwind

//递推
//见https://blog.csdn.net/accelerator_/article/details/9636923
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <cctype>
#include <algorithm>
#include <sstream>
#define EPS 1e-6
using namespace std;
int main(){
    long long n,x;
    double a0,an1,c[3001],s;
    cin>>x;
    while (x--)
    {
        s=0;
        cin>>n>>a0>>an1;
        for(int i=1;i<=n;i++)
            cin>>c[i];
        for(int i=0;i<n;i++){
            s+=c[i+1]*(n-i);
        }
        double aa=(an1-2*s+n*a0)/(n+1);
        printf("%.2f
",aa);
        if(x!=0) printf("
");
    }
    return 0;
}