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
// Arti1990, II UWr

#include <bits/stdc++.h>

#define forr(i, n)                  for(int i=0; i<n; i++)
#define FOREACH(iter, coll)         for(auto iter = coll.begin(); iter != coll.end(); ++iter)
#define FOREACHR(iter, coll)        for(auto iter = coll.rbegin(); iter != coll.rend(); ++iter)
#define lbound(P,K,FUN)             ({auto SSS=P, PPP = P-1, KKK=(K)+1; while(PPP+1!=KKK) {SSS = (PPP+(KKK-PPP)/2); if(FUN(SSS)) KKK = SSS; else PPP = SSS;} PPP;})
#define testy()                     int _tests; cin>>_tests; FOR(_test, 1, _tests)
#define CLEAR(tab)                  memset(tab, 0, sizeof(tab))
#define CONTAIN(el, coll)           (coll.find(el) != coll.end())
#define FOR(i, a, b)                for(int i=a; i<=b; i++)
#define FORD(i, a, b)               for(int i=a; i>=b; i--)
#define MP                          make_pair
#define PB                          push_back
#define ff                          first
#define ss                          second
#define deb(X)                      X;
#define SIZE(coll) 					((int)coll.size())

#define M 1000000007
#define INF 1000000007LL

using namespace std;

int n, m, a;
int tab[1000007];

long long policz(long long l, long long a, long long p)
{
    return a*(a-1)*(a-2)/6 + a*(a-1)/2*(l+p) + a*l*p;
}

bool sprawdz(long long s)
{
    long long l = 0, a = 0, p = s;
    FOR(i, 1, n)
    {
        l += a;
        a = 0;
        while(policz(l, a, p) < tab[i])
        {
            a++;
            p--;
            if(p < 0)
                return 0;
        }
    }
    return 1;
}

int solve()
{
    int ile = 0;
    cin >> n;
    FOR(i, 1, n)
    {
        cin >> tab[i];
        if(tab[i] > 0)
            ile++;
    }

    int pocz = ile-1, kon = ile + 2025, s;
    while(pocz+1 < kon)
    {
        s = (pocz + kon)/2;
        //cout << "pocz: " << pocz << ", kon: " << kon << ", s: " << s << '\n';
        if(sprawdz(s))
            kon = s;
        else
            pocz = s;
    }
    cout << kon << '\n';
    

    return 0;
}

int main()
{
    std::ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    testy()
        solve();

    return 0;
}