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 = 2e5 + 5;
int a[maxn];
int p[maxn];
int n;
long double f(long double x) {
  long double minx = 0;
  long double maxx = 0;
  for (int i = 0; i <= n; i++)
    minx = min(minx, (long double)p[i] + (long double)i * x),
    maxx = max(maxx, (long double)p[i] + (long double)i * x);
  return maxx - minx;
}
int main() {
  scanf("%d", &n);
  p[0] = 0;
  for (int i = 0; i < n; i++) {
    scanf("%d", &a[i]);
    p[i + 1] = p[i] + a[i];
  }
  long double l = -3e9;
  long double r = 3e9;
  for (int it = 0; it < 150; it++) {
    long double m1 = l + (r - l) / 3.;
    long double m2 = r - (r - l) / 3.;
    if (f(m1) < f(m2))
      r = m2;
    else
      l = m1;
  }
  printf("%.30f", (double)(f(l)));
  return 0;
}
