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
//Sylwia Sapkowska 
#include <bits/stdc++.h> 
#pragma GCC optimize("O3", "unroll-loops")
using namespace std;
#define int long long
typedef pair<int, int> T;
const int A = 3e5;

void solve(){
    int n; cin >> n;
    vector<int>a(n+1);
    for (int i = 1; i<=n; i++) cin >> a[i];
    auto check = [&](int k){
        int j = 0;
        for (int i = 1; i<=n; i++){
            int f = -1;
            for (int x = (i == n ? k-j : 0); x <= k-j; x++){
                int t = (x * (x-1) * (x-2))/6 + (x * (x-1) * (k-x))/2 + x * j * (k-x-j);
                if (t >= a[i]){
                    f = x;
                    break;
                }
            }
            if (f == -1) return false;
            j += f;
        }  
        return j <= k;
    };
    int l = 0, r = A;
    int ans = A;
    while (r >= l){
        int m = (l+r)/2;
        if (check(m)){
            ans = m;
            r = m-1;
        } else l = m+1;
    }
    cout << ans << "\n";
}
 
int32_t main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int t = 1;
    cin >> t;
    while (t--) solve();

    return 0;
}