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
#ifndef LOCAL
#pragma GCC optimize("O3")
#endif
#include <bits/stdc++.h>
#define FOR(i,p,k) for(int i=(p);i<=(k);++i)
#define REP(i,n) FOR(i,0,(n)-1)
#define RFOR(i,p,n) for(int i=(p);i>=(n);--i)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define ssize(x) int((x).size())
#define fi first
#define se second
#define V vector
#define pb push_back
#define eb emplace_back
#define C const
#define pn printf("\n")
using namespace std;
typedef long long ll;
typedef V<int> vi;
typedef V<ll> vll;
typedef const int ci;
typedef const ll cll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
void chmin(auto &a, auto b){a=min(a,b);}
void chmax(auto &a, auto b){a=max(a,b);}
ci inf = 2.1e9;
cll infll = 4.5e18;

int I(){
    int z;
    scanf("%d", &z);
    //cin >> z;
    return z;
}

void answer(){
    int n = I();
    vi ciag;
    REP(i, n){
        int a = I();
        if(a) ciag.eb(a);
    }
    n = ssize(ciag);

    auto kombi = [&](ll a, ll b, ll c){
        ll ret = 0;
        ret += a*b*c;
        ret += b*(b-1)/2 * (a+c);
        ret += b*(b-1)*(b-2)/6;
        return ret;
    };

    auto xd = [&](int k){
        int mini = 0;
        REP(poz, n){
            int wymaganie = ciag[poz];
            int nowe = k+1;
            FOR(suma, mini, k){
                int git = 0;
                FOR(a, mini, suma){
                    int b = suma-a;
                    if(kombi(poz+a, 1+b, n-poz-1 + k-a-b) >= wymaganie) git = 1;
                }
                if(git){
                    nowe = suma;
                    break;
                }
            }
            mini = nowe;
        }
        return mini <= k;
    };

    int wyn = inf;
    for(int poc = 0, kon = 2000; poc <= kon;){
        int sr = (poc+kon)/2;
        if(xd(sr)) wyn = sr, kon = sr-1;
        else poc = sr+1;
    }
    printf("%d\n", n+wyn);
}

int main(){
    //ios_base::sync_with_stdio(0);
    //cin.tie(0);
    int tt = 1;
    tt = I();
    while(tt--) answer();
}