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>
#pragma GCC optimize("", on)
using namespace std;
const long long maxn = 5e5 + 13;
const long long INF = 2e9 + 13;
const long long MOD = 1e9 + 7;
double a[maxn];
double f(double x, long long n) {
  vector<double> pref(n), b(n);
  double minS = INF, maxS = -INF;
  pref[0] = a[1] - x;
  for (long long i = 1; i <= n; ++i)
    b[i - 1] = a[i] - x, minS = min(a[i] - x, minS), maxS = max(maxS, a[i] - x);
  for (long long i = 1; i < n; ++i) pref[i] = pref[i - 1] + b[i];
  double minl = 0;
  for (long long i = 0; i < n; ++i) {
    maxS = max(maxS, pref[i] - minl);
    minl = min(pref[i], minl);
  }
  minl = 0;
  for (long long i = 0; i < n; ++i) {
    minS = min(minS, pref[i] - minl);
    minl = max(minl, pref[i]);
  }
  return max(abs(minS), abs(maxS));
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long n;
  cin >> n;
  double maxe = 0;
  for (long long i = 1; i <= n; ++i) cin >> a[i], maxe = max(maxe, abs(a[i]));
  double l = -maxe - 1, r = maxe + 1;
  for (long long i = 1; i <= 100; ++i) {
    double x1 = l + (r - l) / 3;
    double x2 = l + (2 * (r - l)) / 3;
    double f1 = f(x1, n);
    double f2 = f(x2, n);
    if (f1 > f2)
      l = x1;
    else
      r = x2;
  }
  cout << fixed << setprecision(10) << f(l, n) << "\n";
  return 0;
}
