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
#include <bits/stdc++.h>
using namespace std;

#define ll long long

ll npo3 (ll n) {
    return n*(n-1)*(n-2)/6;
}

ll npo2 (ll n) {
    return n*(n-1)/2;
}


bool rozw(vector<ll> &a, ll k, int n) {
    ll x = 0;
    for (int i = 0; i < n; i++) {
        ll w = 0;
        ll p = 1<<8;
        while (p > 0) {
            w += p;
            if (w > k-x) {
                w -= p;
                p /= 2;
                continue;
            }
            ll y = npo3(w)+npo2(w)*(k-w)+w*x*(k-w-x);
            if (y >= a[i]) {
                w -= p;
            } 
            p /= 2;
        }
        if (a[i] != 0) {
            x += w+1;
        }
    }
    if (x <= k) {
        return 1;
    }
    return 0;
}


int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int t;
    cin >> t;
    for (int _ = 0; _ < t; _++) {
        int n;
        cin >> n;
        vector<ll> a (n, 0);
        for (int i = 0; i < n; i++) {
            cin >> a[i];
        }
        ll w = 0;
        ll p = 1<<27;
        while (p > 0) {
            w += p;
            if (rozw(a, w, n)) {
                w -= p;
            }
            p /= 2;
        }
        cout << w+1 << '\n';
    }
}