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

using namespace std;
#define pb push_back
#define st first
#define nd second
typedef long long ll;
typedef long double ld;
const ll I = 1000'000'000'000'000'000LL;
const int II = 2'000'000'000;
const ll M = 1000'000'007LL;
const int N = 1000'007;
ll tab[N];

bool Check(int n, ll x)
{
    ll pr = 0;
    for(int i = 1; i <= n; ++i)
    {
        ll su, a, cur = II / 2;
        for(int j = 0; j <= x; ++j)
        {
            a = 1 + j; su = n - i + (x - j);

            ll il = pr * su * a;
            il += (pr + su) * ((a * (a - 1LL)) / 2LL);
            il += (a * (a - 1LL) * (a - 2LL)) / 6LL;
            if(il >= tab[i])
            {
                cur = j;
                break;
            }
        }
        if(cur > x) return 0;
        x -= cur;
        pr += cur + 1;
    }
    return 1;
}

int BS(int n)
{
    int p = 0, s, k = 2007;
    while(p < k)
    {
        s = (p + k) / 2;
        if(Check(n, s))
            k = s;
        else
            p = s + 1;
    }
    return p;
}

int Compress(int n)
{
    int m = 0;
    for(int i = 1; i <= n; ++i)
    {
        if(tab[i] > 0)
        {
            ++m;
            tab[m] = tab[i];
        }
    }
    return m;
}

void Solve()
{
    int n;
    cin >> n;
    for(int i = 1; i <= n; ++i)
        cin >> tab[i];
    n = Compress(n);
    int ans = 0;
    ans = BS(n) + n;
    //cout << Check(n, 2) << "\n";
    cout << ans << "\n";
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int t; cin >> t;
    while(t--)
        Solve();

    return 0;
}