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
#include <stdio.h>
#include <algorithm>

using namespace std;

#define N 200000
#define K 184
#define lli long long int

int t, n, ti, niepuste;

int st, en, act;

lli min_result, max_result, act_result;

int a[N];
lli over3[K];
lli over2[K];
lli po_lewej,zostalo,mozliwe;



bool czy_wystarczy(lli result) {
    lli po_lewej = 0;
    lli zostalo = result;
    for (int i = 0; i < niepuste; i++) {
        if(zostalo==0) return false;
        lli st=1, en=min(zostalo, (lli)K);
        while (st < en) {
            lli mid = (st + en) / 2;
            mozliwe = po_lewej * mid * (zostalo - mid) + over3[mid] + over2[mid] * (result - mid);
            if (mozliwe >= a[i]) {
                en = mid;
            } else {
                st = mid + 1;
            }
        }
        mozliwe = po_lewej * st * (zostalo - st) + over3[st] + over2[st] * (result - st);
        if(mozliwe >= a[i]) {
            po_lewej += st;
            zostalo -= st;
        } else {
            return false;
        }
        /*for (y = 1; y <= K; y++) {
            lli x = result - z - y;
            if (x < 0) {
                return false;
            }
            lli mozliwe = z * y * x + over3[y] + over2[y] * (x + z);
            if (mozliwe >= a[i]) {
                z += y;
                if (z > result) {
                    return false;
                }
                break;
            }
        }*/
    }
    return true;
}

int main() {
    for (lli i = 0; i < K; i++) {
        over3[i] = i * (i - 1) * (i - 2) / 6;
        over2[i] = i * (i - 1) / 2;
    }

    scanf("%d", &t);
    for (int ti = 0; ti < t; ti++) {
        scanf("%d", &n);
        niepuste = 0;
        max_result = 0;
        for (int i = 0; i < n; i++) {
            scanf("%d", &a[niepuste]);
            if (a[niepuste] > 0) {
                auto it = lower_bound(over3, over3 + K, a[niepuste]);
                max_result += distance(over3, it);
                niepuste++;
            }
        }
        min_result = max((lli)niepuste, 3LL);
        max_result = min(max_result, (lli)200008);

        while (min_result < max_result) {
            //printf("%lld %lld\n", min_result, max_result);
            act_result = (min_result + max_result) / 2;
            if (czy_wystarczy(act_result)) {
                max_result = act_result;
            } else {
                min_result = act_result + 1;
            }
        }

        printf("%lld\n", min_result);
    }
    return 0;
}