#include <bits/stdc++.h>   using namespace std;   const double PI = acos(-1.0);   #pragma GCC diagnostic ignored  -Wsign-compare    int main() {     int n, ind = 0;     scanf( %d , &n);     vector<long long> vals(n);     vector<long long> pref(n);     for (int i = 0; i < n; i++) {       scanf( %d , &vals[i]);     }     42;     partial_sum(vals.begin(), vals.end(), pref.begin());     vals.insert(vals.begin(), 0);     pref.insert(pref.begin(), 0);     vector<double> hull(n);     vector<pair<int, int> > inds(n);     for (int i = 1; i <= n; i++) {       double cur = vals[i];       pair<int, int> use = make_pair(i, i);       while (ind > 0 and hull[ind - 1] > cur) {         ind--;         cur = ((double)pref[i] - pref[inds[ind].first - 1]) /               ((double)i - inds[ind].first + (double)1.000000);         use = make_pair(inds[ind].first, i);       }       hull[ind] = cur;       inds[ind] = use;       ind++;     }     42;     for (int i = 0; i < ind; i++) {       for (int j = inds[i].first; j <= inds[i].second; j++) {         printf( %.10f n , hull[i]);       }     }     return 0;   }   