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 N = 2000000;
const double esp = 3e-12;
int n;
double a[N + 5], b[N + 5];
double get_max() {
  double tmp = 0, ans = 0;
  for (int i = 1; i <= n; i++) {
    tmp += b[i];
    if (tmp < 0) {
      tmp = 0;
    }
    ans = max(ans, tmp);
  }
  return ans;
}
double get_ans(double x) {
  double ans1, ans2;
  for (int i = 1; i <= n; i++) b[i] = a[i] - x;
  ans1 = get_max();
  for (int i = 1; i <= n; i++) b[i] = -b[i];
  ans2 = get_max();
  return max(ans1, ans2);
}
double solve() {
  double l = -1e4, r = 1e4;
  while (l + esp < r) {
    double midl = (2 * l + r) / 3.0;
    double midr = (r * 2 + l) / 3.0;
    double w1 = get_ans(midl);
    double w2 = get_ans(midr);
    if (w1 < w2)
      r = midr;
    else
      l = midl;
  }
  return get_ans(l);
}
int main() {
  while (scanf("%d", &n) != EOF) {
    for (int i = 1; i <= n; i++) scanf("%lf", &a[i]);
    printf("%.15f\n", solve());
  }
  return 0;
}
