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("Ofast")
using namespace std;
;
long long max(long long a, long long b) {
  if (a > b)
    return a;
  else
    return b;
}
long long min(long long a, long long b) {
  if (a > b)
    return b;
  else
    return a;
}
long long gcd(long long a, long long b) { return (b == 0) ? a : gcd(b, a % b); }
inline long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
inline long long normalize(long long x, long long mod) {
  x %= mod;
  if (x < 0) x += mod;
  return x;
}
long long dx[4] = {0, 0, 1, -1};
long long dy[4] = {1, -1, 0, 0};
string abc = "abcdefghijklmnopqrstuvwxyz";
const double PI = acosl(-1);
const long long mod = 998244353;
const long long inf = 1e18 + 5;
inline long long add(long long a, long long b, long long p = mod) {
  long long c = a + b;
  if (c >= p) c -= p;
  return c;
}
inline long long sub(long long a, long long b, long long p = mod) {
  long long c = a - b;
  if (c < 0) c += p;
  return c;
}
inline long long mul(long long a, long long b, long long p = mod) {
  return (a * 1ll * b) % p;
}
long long floor1(long long n, long long k) {
  if (n % k == 0 || n >= 0) return n / k;
  return (n / k) - 1;
}
long long ceil1(long long n, long long k) { return floor1(n + k - 1, k); }
long long powm(long long a, long long b) {
  long long res = 1;
  while (b) {
    if (b & 1) res = (res * a) % mod;
    a = (a * a) % mod;
    b >>= 1;
  }
  return res;
}
const long long N = 2e5 + 5;
long long n, m, k;
long long a[N], b[N];
long double cache[N];
long double dp() {
  long double mx = 0.0;
  long double cur = 0.0;
  for (long long i = (1); i < (n + 1); ++i) {
    if (cur + cache[i] > cache[i])
      cur = cur + cache[i];
    else
      cur = cache[i];
    if (cur > mx) mx = cur;
  }
  return mx;
}
long double f(long double x) {
  long double ans = 0.0;
  for (long long i = (1); i < (n + 1); ++i) cache[i] = a[i] - x;
  ans = max(ans, dp());
  for (long long i = (1); i < (n + 1); ++i) cache[i] = -cache[i];
  ans = max(ans, dp());
  return ans;
}
long double ternary_search(long double l, long double r) {
  long double eps = 1e-12;
  while (r - l > eps) {
    long double m1 = l + (r - l) / 3.00;
    long double m2 = r - (r - l) / 3.00;
    long double f1 = f(m1);
    long double f2 = f(m2);
    if (f1 > f2)
      l = m1;
    else
      r = m2;
  }
  return f(l);
}
void solve() {
  cin >> n;
  for (long long i = (1); i < (n + 1); ++i) cin >> a[i];
  cout << ternary_search(-20005, 20005) << "\n";
}
signed main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cout << fixed << setprecision(10);
  long long t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
