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>
int T;
double a[200005];
double f(double x) {
  int i;
  double m = 0, n = 0, s[200005] = {0};
  for (i = 1; i <= T; i++) {
    s[i] = s[i - 1] + a[i - 1] - x;
    m = m > s[i] ? m : s[i];
    n = n < s[i] ? n : s[i];
  }
  return m - n;
}
int main() {
  int i, t = 200;
  double l = -1e5, m, n, r = 1e5;
  scanf("%d", &T);
  for (i = 0; i < T; i++) scanf("%lf", &a[i]);
  while (t--) {
    m = l + (r - l) / 3;
    n = r - (r - l) / 3;
    if (f(m) < f(n))
      r = n;
    else
      l = m;
  }
  printf("%.15lf\n", f(m));
}
