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
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
// clang-format off
#include <bits/stdc++.h>

using namespace std;

#define ALL(x) (x).begin(), (x).end()

template<class C> void mini(C &a5, C b5) { a5 = min(a5, b5); }
template<class C> void maxi(C &a5, C b5) { a5 = max(a5, b5); }

#ifdef LOCAL
const bool debug = true;
#else
const bool debug = false;
#define cerr if (true) {} else cout
#endif
// clang-format on

#define int long long
#define double long double

const int INF = 1e18;
const int mod = 1e9 + 7;

const int MAX_DWUMIAN = 1000;
int dwumian[MAX_DWUMIAN + 1][MAX_DWUMIAN + 1];
void init_dwumian() {
    for (int i = 0; i <= MAX_DWUMIAN; i++) {
        dwumian[i][0] = 1;
        dwumian[i][i] = 1;
    }
    for (int i = 1; i <= MAX_DWUMIAN; i++) {
        for (int j = 1; j < i; j++) {
            dwumian[i][j] = dwumian[i - 1][j - 1] + dwumian[i - 1][j];
        }
    }
}

struct Solver {
    int n;
    vector<int> v;

    Solver() {
        cin >> n;
        for (int i = 0; i < n; i++) {
            int x;
            cin >> x;
            v.push_back(x);
        }

        int l = 0, r = 1e6;
        while (r - l > 1) {
            int m = (l + r) / 2;
            if (check(m))
                r = m;
            else
                l = m;
        }

        cout << r << "\n";
    }

    bool check(int res) {
        int prev = 0, next = res;
        for (int a : v) {
            if (a == 0)
                continue;

            bool good = false;
            for (int m = 1; m <= next; m++) {
                int count = prev * m * (next - m);
                count += dwumian[m][3];
                count += (res - m) * dwumian[m][2];

                if (count >= a) {
                    next -= m;
                    prev += m;
                    good = true;
                    break;
                }
            }

            if (!good)
                return false;
            // int l = 0, r = min(MAX_DWUMIAN, next + 1);
            // while (r - l > 1) {
            //     int m = (l + r) / 2;

            //     int count = prev * m * (next - m);
            //     count += dwumian[m][3];
            //     count += (res - m) * dwumian[m][2];

            //     if (count < a)
            //         l = m;
            //     else
            //         r = m;
            // }

            // if (r == next + 1)
            //     return false;
            // next -= r;
            // prev += r;
        }

        return true;
    }
};

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

    init_dwumian();

    int t;
    cin >> t;
    while (t--) {
        Solver solver;
    }

    return 0;
} /*

 */