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 n, v[1000009 * 2];
double f(double x) {
  double ans = 0, sum = 0;
  for (int i = 1; i <= n; i++) {
    sum += v[i] - x;
    ans = max(sum, ans);
    if (sum < 0) sum = 0;
  }
  sum = 0;
  double ans1 = 1000000009;
  for (int i = 1; i <= n; i++) {
    sum += v[i] - x;
    ans1 = min(sum, ans1);
    if (sum > 0) sum = 0;
  }
  return max(abs(ans1), ans);
}
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> v[i];
  double l = -10000, r = 10000;
  for (int i = 1; i <= 100; i++) {
    double m1 = l + (r - l) / 3;
    double m2 = r - (r - l) / 3;
    if (f(m1) < f(m2))
      r = m2;
    else
      l = m1;
  }
  printf("%.6lf", f(l));
}
