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 int maxn = 200010;
const int inf = maxn;
int n;
int a[maxn];
int main() {
  cin >> n;
  int maxa = -inf, mina = inf;
  for (int i = (1); i <= (n); i++) {
    scanf("%d", &a[i]);
    maxa = ((maxa) > (a[i]) ? (maxa) : (a[i]));
    mina = ((mina) > (a[i]) ? (a[i]) : (mina));
  }
  double l = mina, r = maxa;
  double mid1 = 0, mid2 = 10, ans1, ans2;
  double maxdp, mindp, maxp, minp;
  for (int ii = (0); ii <= (200); ii++) {
    mid1 = l + (r - l) / 3;
    mid2 = r - (r - l) / 3;
    maxdp = mindp = maxp = minp = 0;
    for (int i = (1); i <= (n); i++) {
      maxdp = (maxdp + a[i] - mid1) < 0 ? 0 : maxdp + a[i] - mid1;
      maxp = ((maxp) > (maxdp) ? (maxp) : (maxdp));
      mindp = (mindp + a[i] - mid1) > 0 ? 0 : mindp + a[i] - mid1;
      minp = ((minp) > (mindp) ? (mindp) : (minp));
    }
    ans1 = max(fabs(maxp), fabs(minp));
    maxdp = mindp = maxp = minp = 0;
    for (int i = (1); i <= (n); i++) {
      maxdp = (maxdp + a[i] - mid2) < 0 ? 0 : maxdp + a[i] - mid2;
      maxp = ((maxp) > (maxdp) ? (maxp) : (maxdp));
      mindp = (mindp + a[i] - mid2) > 0 ? 0 : mindp + a[i] - mid2;
      minp = ((minp) > (mindp) ? (mindp) : (minp));
    }
    ans2 = max(fabs(maxp), fabs(minp));
    if (ans1 > ans2)
      l = mid1;
    else
      r = mid2;
  }
  printf("%.10lf\n", ans2);
  return 0;
}
