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

using namespace std;

typedef unsigned uint;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ldbl;
typedef pair<int, int> pii;
typedef pair<uint, uint> puu;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pull;
typedef pair<double, double> pdd;
typedef vector<int> vi;
typedef vector<uint> vu;
typedef vector<ll> vll;
typedef vector<ull> vull;
typedef vector<pii> vpii;
typedef vector<puu> vpuu;
typedef vector<pll> vpll;
typedef vector<pull> vpull;
typedef vector<string> vstr;
typedef vector<double> vdbl;
typedef vector<ldbl> vldbl;
#define pb push_back
#define ppb pop_back
#define pfr push_front
#define ppfr pop_front
#define emp emplace
#define empb emplace_back
#define be begin
#define rbe rbegin
#define all(x) (x).be(), (x).end()
#define rall(x) (x).rbe(), (x).rend()
#define fir first
#define sec second
#define mkp make_pair
#define brif(cond) if (cond) break
#define ctif(cond) if (cond) continue
#define retif(cond) if (cond) return
void fastio() {ios_base::sync_with_stdio(false);cin.tie(nullptr);}
template<typename T> T gcd(T a, T b) {return b ? gcd(b, a%b) : a;}
template<typename T> T extgcd(T a, T b, T &x, T &y)
{
    T x0 = 1, y0 = 0, x1 = 0, y1 = 1;
    while (b) {
        T q = a/b; a %= b; swap(a, b);
        x0 -= q*x1; swap(x0, x1);
        y0 -= q*y1; swap(y0, y1);
    }
    x = x0; y = y0; return a;
}
int ctz(uint x) {return __builtin_ctz(x);}
int ctzll(ull x) {return __builtin_ctzll(x);}
int clz(uint x) {return __builtin_clz(x);}
int clzll(ull x) {return __builtin_clzll(x);}
int popcnt(uint x) {return __builtin_popcount(x);}
int popcntll(ull x) {return __builtin_popcountll(x);}
int bsr(uint x) {return 31^clz(x);}
int bsrll(ull x) {return 63^clzll(x);}

#define N 200016
#define C 183

int a[N], tmp[N];

int choose2(int k) { return k*(k-1)/2; }
int choose3(int k) { return k*(k-1)*(k-2)/6; }
ll calc(int pre, int suf, int c) { return (ll)pre*c*suf+ll(pre+suf)*choose2(c)+choose3(c); }

bool check(int n, int s)
{
    int p = 0;
    for (int i = 0; i < n; ++i) {
        int b = 1, e = min(s, C);
        retif(b > e) false;
        while (b < e) {
            int c = (b+e)/2;
            if (calc(p, s-c, c) >= a[i]) e = c;
            else b = c+1;
        }
        retif(calc(p, s-b, b) < a[i]) false;
        p += b;
        s -= b;
    }
    return true;
}

void solve()
{
    int n, nn = 0;

    cin >> n;
    for (int i = 0; i < n; ++i) cin >> tmp[i];
    for (int i = 0; i < n; ++i) {
        if (tmp[i]) a[nn++] = tmp[i];
    }
    n = nn;
    int b = 0, e = C*n;
    while (b < e) {
        int m = (b+e)/2;
        if (check(n, m)) e = m;
        else b = m+1;
    }
    cout << b << '\n';
}

int main()
{
    fastio();

    int t;
    cin >> t;
    for (; t; --t) solve();

    return 0;
}