1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
#include "bits/stdc++.h"
using namespace std;
#define rep(i,a,b) for(int i=(a); i<(b); ++i)
#define all(x) x.begin(),x.end()
#define sz(x) int(x.size())
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vi> vvi;

ll tri(ll a){
    return a*(a-1)/2;
}
ll qua(ll a){
    return a*(a-1)*(a-2)/6;
}

void solve(){
    ll n; cin >> n;
    vi a(n);
    for(auto& c : a) cin >> c;

    ll lo = 0, hi = 200*n;
    while(lo<hi){
        ll mid = (lo+hi)/2;

        bool pos = 1;
        ll L = 0;
        rep(i,0,n){
            ll R = mid-L;
            for(ll T = 0;;++T){
                if (R<T){
                    pos = 0;
                    goto RRR;
                }
                ll take = L*T*(R-T) + tri(T)*(L+R-T) + qua(T);
                if (take >= a[i]){
                    L += T;
                    break;
                }
            }
        }

        RRR:
        if (pos){
            hi = mid;
        }else{
            lo = mid + 1;
        }
    }

    cout << lo << '\n';
}

int main(){
    cin.tie(NULL),cin.sync_with_stdio(false);
    
    int t; cin >> t;
    while(t--) solve();
}