#include <bits/stdc++.h>
using namespace std;
long long fpm(long long b, long long e, long long m) {
  long long t = 1;
  for (; e; e >>= 1, b = b * b % m) e & 1 ? t = t * b % m : 0;
  return t;
}
template <class T>
inline bool chkmin(T &a, T b) {
  return a > b ? a = b, true : false;
}
template <class T>
inline bool chkmax(T &a, T b) {
  return a < b ? a = b, true : false;
}
template <class T>
inline T sqr(T x) {
  return x * x;
}
template <class edge>
struct Graph {
  vector<vector<edge> > adj;
  Graph(int n) {
    adj.clear();
    adj.resize(n + 5);
  }
  Graph() { adj.clear(); }
  void resize(int n) { adj.resize(n + 5); }
  void add(int s, edge e) { adj[s].push_back(e); }
  void del(int s, edge e) { adj[s].erase(find(iter(adj[s]), e)); }
  int deg(int v) { return adj[v].size(); }
  vector<edge> &operator[](int t) { return adj[t]; }
};
const int maxn = 1100000;
int a[maxn], L[maxn], R[maxn];
long long dff[maxn];
char buf[20];
int main() {
  ios_base::sync_with_stdio(false);
  int n, m;
  stack<int> stk;
  cin >> n;
  for (int i = 1; i <= n; ++i) cin >> a[i];
  stk = stack<int>(), stk.push(0);
  for (int i = 1; i <= n; ++i) {
    for (; a[stk.top()] > a[i]; stk.pop())
      ;
    L[i] = i - stk.top(), stk.push(i);
  }
  stk = stack<int>(), stk.push(n + 1);
  for (int i = n; i >= 1; --i) {
    for (; a[stk.top()] >= a[i]; stk.pop())
      ;
    R[i] = stk.top() - i, stk.push(i);
  }
  for (int i = 1; i <= n; ++i) {
    dff[0] += a[i], dff[L[i]] -= a[i], dff[R[i]] -= a[i],
        dff[L[i] + R[i]] += a[i];
  }
  for (int i = 1; i < n; ++i) dff[i] += dff[i - 1];
  for (int i = 1; i < n; ++i) dff[i] += dff[i - 1];
  cin >> m;
  cout << setprecision(16);
  for (int i = 1, k; i <= m; ++i)
    cin >> k, --k, sprintf(buf, "%.13f", 1.0 * dff[k] / (n - k)),
        cout << buf << endl;
  return 0;
}
