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

constexpr int MAX_N = 2e5;

int t, n;
int a[MAX_N + 1];

int l, m, r;

long long choose_2(int x) {
    return ((long long)x * (x - 1)) / 2;
}

long long choose_3(int x) {
    return ((long long)x * (x - 1) * (x - 2)) / 6;
}

bool possible(int smaller, int equal, int bigger, int games) {
    long long total = (long long)smaller * equal * bigger;
    
    total += choose_2(equal) * smaller;
    total += choose_2(equal) * bigger;
    total += choose_3(equal);

    return total >= games;
}

bool check(int available) {
    int smaller = 0;

    for(int i = 1; i <= n; i++) {
        if(a[i] == 0) {
            continue;
        }

        int equal = -1;
        
        for(int j = 1; j <= 183; j++) {
            if(smaller + j > available) {
                break;
            }

            if(possible(smaller, j, available - (smaller + j), a[i])) {
                equal = j;
                break;
            }
        }

        if(equal == -1) {
            return false;
        }

        smaller += equal;
    }

    return true;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

    cin >> t;

    while(t--) {
        cin >> n;

        for(int i = 1; i <= n; i++) {
            cin >> a[i];
        }

        l = 3;
        r = (183 * MAX_N) + 1;

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

            if(check(m)) {
                r = m;
            }
            else {
                l = m + 1;
            }
        }

        cout << r << '\n';
    }
}