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;
double a[200005];
int n;
double maxi(double x) {
  double min1 = 0, ans = -1000000007;
  a[1] -= x;
  ans = a[1];
  min1 = min(min1, ans);
  for (int i = 2; i <= n; i++) {
    a[i] -= i * x;
    ans = max(ans, a[i] - min1);
    if (a[i] < min1) min1 = a[i];
  }
  return ans;
}
double mini(double x) {
  double max1 = 0, ans = 1000000007;
  ans = a[1];
  max1 = max(max1, ans);
  a[1] += x;
  for (int i = 2; i <= n; i++) {
    ans = min(ans, a[i] - max1);
    if (a[i] > max1) max1 = a[i];
    a[i] += i * x;
  }
  return ans;
}
int main() {
  int i, j, k;
  double l, r, m, tol = 0.0000001, x = 1, y = 100;
  scanf("%d", &n);
  for (i = 1; i <= n; i++) {
    scanf("%lf", &a[i]);
    a[i] += a[i - 1];
  }
  l = -10000, r = 10000;
  while (abs(l - r) >= tol) {
    m = (l + r) / 2;
    y = maxi(m);
    x = mini(m);
    if (x > 0)
      l = m + tol;
    else if (y < 0)
      r = m - tol;
    else if (abs(x) == abs(y)) {
      printf("%lf\n", abs(x));
      return 0;
    } else if (abs(x) > abs(y))
      r = m - tol;
    else
      l = m + tol;
  }
  printf("%lf\n", abs(y));
  return 0;
}
