#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define cmin(a,b) a=min(a,b)
#define cmax(a,b) a=max(a,b)
#define modd(a,b) a=a%b
#define pb push_back
#define db double
#define lowbit(x) x&(-x)
#define cerr(x) cout<<#x<<"="<<x<<endl
#define fi first
#define se second
const ll mod=1e9+7;
#define N 300010
const db eps=1e-10;
int n,pos;
db a[N],pre[N];
ll ksm(ll a,ll b) {ll ans=1,bs=a;while(b) {if(b&1) ans=ans*bs%mod;bs=bs*bs%mod;b>>=1;}return ans;}
bool ck(db mid) {
    for(int i=1;i<=n;i++) pre[i]=pre[i-1]+a[i]-mid;
    db mx=0,mxx=0;
    for(int i=1;i<pos;i++) cmax(mx,pre[pos-1]-pre[i-1]);
    for(int i=pos+1;i<=n;i++) cmax(mxx,pre[i]-pre[pos]);
    return mx+mxx+a[pos]-mid>=0;
}
void solve() {
    cin>>n;
    for(int i=1;i<=n;i++) cin>>a[i];
    pos=1;
    for(int i=2;i<n;i++) if(a[i]<a[i-1] && a[i]<a[i+1]) pos=i;
    db l=0,r=*max_element(a+1,a+n+1),mid;
    // cout<<log2(1e18)<<endl;
    int cnt=0;
    while(fabs(r-l)>eps) {
        // if(++cnt==100) break;
        mid=(l+r)/2;
        if(ck(mid)) l=mid;
        else r=mid;
    }
    cout<<fixed<<setprecision(12)<<l<<endl;
}
int main() {
    ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int T;
    cin>>T;
    while(T--) 
    solve();
    return 0;
}