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
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
#include <bits/stdc++.h>

using namespace std;

#define ll long long

#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) rng(i,0,b)

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;

typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;

typedef pair<int,int> ii;

template<class t> using vc=vector<t>;
template<class t> using vvc=vc<vc<t>>;

const int MOD = 998244353;

ll read(){
    ll i;
    cin>>i;
    return i;
}

vi readvi(int n,int off=0,int shift=0){
    vi v(n+shift);
    rep(i,shift)v[i]=0;
    rep(i,n)v[i+shift]=read()+off;
    return v;
}

void YesNo(bool condition, bool do_exit=true) {
    if (condition)
        cout << "Yes" << endl;
    else
        cout << "No" << endl;
    if (do_exit)
        exit(0);
}

ll sqr(ll x) {
    return x*x;
}

//integer square root
long long isqrt (long long x) {
    long long ans = 0;
    for (ll k = 1LL << 30; k != 0; k /= 2) {
        if ((ans + k) * (ans + k) <= x) {
            ans += k;
        }
    }
    return ans;
}

// k >= 1
inline ll choose(ll n, ll k) {
    if (k > n)
        return 0;
    ll res = 1;
    rep(i,k)
        res *= n-i;
    rng(i,2,k+1)
        res /= i;
    return res;
}

int main(void ) {
    ios::sync_with_stdio(false);
    cin.tie(NULL);

    int t;
    cin >> t;
    rep(_,t) {
        int n;
        cin >> n;
        vi a = readvi(n);
        int j = 0;
        rep(i, n)
            if (a[i])
                a[j++] = a[i];
        a.erase(a.begin()+j, a.end());
        n = j;

        if (n==1) {
            ll l = 1, u = a[0]+2;
            while (l<u) {
                ll m = (l + u) / 2;
                if (m*(m-1)*(m-2)/6 >= a[0])
                    u = m;
                else
                    l = m+1;
            }
            cout << l << endl;
            continue;
        }

        ll l = n, u = n + 2 * *max_element(a.begin(), a.end());

        while (l<u) {
            ll m = (l + u) / 2;


            int used = 0;
            ll pref = 0;

            rep(i,n) {
                ll alloc = 0;
                ll triples = 0;

                while (triples < a[i]) {
                    ++used;
                    ++alloc;
                    triples = choose(alloc, 3) + choose(alloc,2) * (m - alloc) + pref * alloc * (m - pref - alloc);
                }
                pref += alloc;

                if (used > m)
                    break;
            }

            if (used <= m)
                u = m;
            else
                l = m + 1;

        }

        cout << l << endl;
    }

    return 0;
}