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

#define rep(i, b, e) for(int i = (b); i <= (e); i++)
#define per(i, b, e) for(int i = (e); i >= (b); i--)
#define FOR(i, b, e) rep(i, b, (e) - 1)
#define SZ(x) int(x.size())
#define all(x) x.begin(), x.end()
#define pb push_back
#define mp make_pair
#define st first
#define nd second
using ll = long long;
using vi = vector<int>;
using pii = pair<int, int>;

auto &operator<<(auto &o, pair<auto, auto> p) {
    return o << "(" << p.st << ", " << p.nd << ")"; }
auto operator<<(auto &o, auto x)->decltype(end(x), o) {
    o << "{"; int i=0; for(auto e: x) o << ", " + 2*!i++ << e;
    return o << "}"; }
#ifdef LOCAL
#define deb(x...) cerr << "[" #x "]: ", [](auto...$) { \
    ((cerr << $ << "; "),...) << endl; }(x)
#else
#define deb(...)
#endif

void solve() {
    int n;
    cin >> n;
    vi a(n);
    for(auto &x: a) cin >> x;
    auto tri = [](int x) {
        return x * (x - 1) * (x - 2) / 6;
    };
    auto bi = [](int x) {
        return x * (x - 1) / 2;
    };
    auto check = [&](int k) {
        int lewo = 0, prawo = k;
        FOR(i, 0, n) {
            int good = -1;
            FOR(x, 0, min(200, prawo + 1)) {
                ll mam = tri(x) + bi(x) * ll(lewo + prawo - x) + ll(x) * lewo * (prawo - x); 
                if(mam >= a[i]) {
                    good = x;
                    break;
                }
            }
            if(good == -1) return 0;
            lewo += good, prawo -= good;
        }
        return 1;
    };
    int l = -1, r = n * 200;
    while(l + 1 < r) {
        int mid = (l + r) / 2;
        (check(mid) ? r : l) = mid;
    }
    cout << r << '\n';
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    int tt = 1;
    cin >> tt;
    FOR(te, 0, tt) solve();
    return 0;
}