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;

bool check(long long n, vector<long long> a, long long S) {
    long long left = 0;

    for(int i = 0; i < n; i++) {
        long long l, r;
        l = 0;
        r = min(200ll, S);

        if(left * r * (S - r) + r * (r - 1) / 2 * (S - r + left) +
               r * (r - 1) * (r - 2) / 6 <
           a[i]) {
            return false;
        }

        while(l != r) {
            long long m = (l + r) / 2;

            if(left * m * (S - m) + m * (m - 1) / 2 * (S - m + left) +
                   m * (m - 1) * (m - 2) / 6 <
               a[i]) {
                l = m + 1;
            } else {
                r = m;
            }
        }

        S -= l;
        left += l;
    }

    return true;
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int t;
    cin >> t;
    while(t--) {
        long long n;
        cin >> n;
        vector<long long> a(n);
        for(int i = 0; i < n; i++) {
            cin >> a[i];
        }

        long long l, r;
        l = 0;
        r = n * 200;

        while(l != r) {
            long long S = (l + r) / 2;
            bool does_work = check(n, a, S);
            if(does_work) {
                r = S;
            } else {
                l = S + 1;
            }
        }

        cout << l << endl;
    }
}