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

long long n;
long long a[200007];

long long ile_gier(long long cur, long long ilelewo, long long bssr)
{
    __int128 ile = (__int128)cur * (__int128)ilelewo * (__int128)(bssr - ilelewo - cur);
    if (cur >= 2)
    {
        ile += (__int128)(cur * (cur - 1) / 2) * (bssr - cur);
    }
    if (cur >= 3)
    {
        ile += (__int128)(cur * (cur - 1) * (cur - 2)) / 6;
    }
    if(ile > (__int128)1000000000000000000)
    {
        ile = 1000000000000000000;
    }
    return (long long)ile;
}

bool spr(long long sr)
{
    long long ilejuz = 0;
    for (int i = 1; i <= n; i++)
    {
        long long l = 0, r = sr - ilejuz + 1;
        while (l < r)
        {
            long long sr2 = (l + r) / 2;
            if (ile_gier(sr2, ilejuz, sr) >= a[i])
            {
                r = sr2;
            }
            else
            {
                l = sr2 + 1;
            }
        }
        if (l > sr - ilejuz)
        {
            return false;
        }
        ilejuz += l;
    }
    if (ilejuz <= sr)
    {
        return true;
    }
    else
    {
        return false;
    }
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int q;
    cin >> q;
    //q = 1;
    while (q--)
    {
        cin >> n;
        //n = 200000;
        long long suma = 0;
        for (int i = 1; i <= n; i++)
        {
            cin >> a[i];
            //a[i] = 1000000;
            suma += a[i];
        }
        long long l = 3, r = 3 * suma + 7, odp = r;
        while (l <= r)
        {
            long long sr = (l + r) / 2;
            if (spr(sr))
            {
                odp = sr;
                r = sr - 1;
            }
            else
            {
                l = sr + 1;
            }
        }
        cout << odp << endl;
    }
    return 0;
}