#include <iostream>
#include <string>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <map>
#include <bitset>
#include <queue>
#include <set>
#pragma comment(linker, "/STACK:102400000,102400000")
using namespace std;
#define LL long long
#define ULL unsigned long long
#define eps 1e-9
#define N (5000 + 60)
#define M (500050)
#define pii pair<int,int>
#define MP make_pair
#define inf 0x3f3f3f3f
#define md (ll+rr>>1)
#define lson ll, md, ls
#define rson md + 1, rr, rs
#define ls i<<1
#define rs i<<1|1
#define Pi acos(-1.0)
#define mod 1000000007
int a[N];
int main() {
int n;
while(~scanf("%d", &n)) {
int sum = 0;
for(int i = 1; i <= n; ++i) {
scanf("%d", &a[i]);
if(i != 1 && i != n)
sum += a[i];
}
double ans = (a[1] + a[n]) / 2.0;
ans += sum/3.0;
printf("%.10lf\n", ans);
}
}
HDU 5753(期望)
最新推荐文章于 2016-08-03 12:29:36 发布