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
61
62
63
64
65
66
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define ff first
#define ss second
#define MOD 1000000009
#define INF 1000000019
#define INFL 1000000000000000099LL

ll a,b,c,t,n;
vector<ll>bud;


bool check(ll x){
    ll ile=0;
    for(ll i=0;i<n;i++){
        bool czyok=0;
        for(ll j=0;j+ile<=x && j<400;j++){
            if(ile*j*(x-j-ile) + (x-j)*j*(j-1)/2+j*(j-1)*(j-2)/6>=bud[i]){
                ile+=j;
                czyok=1;
                break;
            }
        }
        if(!czyok)
            return 0;
    }
    return x>=ile;
}

void solve(){
    ll pocz=0;
    ll kon=1000000009;
    bud.clear();
    cin>>n;
    for(ll i=0;i<n;i++){
        cin>>a;
        bud.pb(a);
    }
    while(pocz!=kon){
        ll mid=(pocz+kon)/2;
        if(check(mid)){
            kon=mid;
        }
        else    
            pocz=mid+1;
    }
    cout<<pocz<<"\n";
}

int main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);
    cin>>t;
    while(t--){
        solve();
    }
    
    
 
    
    return 0;
}