10
-405 -230 252 -393 -390 -259 97 163 81 -129
 3
10000 -10000 10000
 1
-10000
 20
-16 -23 29 44 -40 -50 -41 34 -38 30 -12 28 -44 -49 15 50 -28 38 -2 0

702.333333333333712
 10000.000000000016371
 0.000000000000000
 113.875000000000043

#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-11;
vector<double> a;
double okk(double m) {
  long long n = a.size();
  double ans = 0;
  double tmp[n], pf[n];
  for (long long i = 0; i < n; i++) {
    tmp[i] = a[i] - m;
    if (i == 0)
      pf[i] = tmp[i];
    else
      pf[i] = pf[i - 1] + tmp[i];
  }
  double mn = 0;
  for (long long i = 0; i < n; i++) {
    ans = max(ans, pf[i] - mn);
    mn = min(mn, pf[i]);
    pf[i] *= -1;
  }
  mn = 0;
  for (long long i = 0; i < n; i++) {
    ans = max(ans, pf[i] - mn);
    mn = min(mn, pf[i]);
  }
  return ans;
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout << setprecision(15) << fixed;
  long long n;
  cin >> n;
  a.resize(n);
  for (long long i = 0; i < n; i++) {
    cin >> a[i];
  }
  double l = -1e6, r = 1e6, ans = 1e15;
  while (r - l > eps) {
    double m1 = l + (r - l) / 3;
    double m2 = r - (r - l) / 3;
    double t1 = okk(m1);
    double t2 = okk(m2);
    ans = min(ans, t1);
    ans = min(ans, t2);
    if (t1 > t2)
      l = m1;
    else
      r = m2;
  }
  cout << ans << '\n';
}
