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
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
#include <algorithm>
#include <iostream>
#include <vector>

using namespace std;
using LL = long long;

constexpr int MAX_K = 4;
constexpr int MAX_N = 185;
constexpr int MAX = 1000000;

vector<vector<LL>> bc(MAX_K, vector<LL>(MAX_N));

void precalculate()
{
    bc[0][0] = 1;

    for (LL n = 1; n < MAX_N; n++)
    {
        for (LL k = 1; k < MAX_K; k++)
        {
            bc[k][n] = bc[k - 1][n - 1] + bc[k][n - 1];
        }

        bc[0][n] = 1;
    }
}

bool check(const vector<int>& buildings, LL max_one, LL x)
{
    LL left = 0;
    LL right = 0;

    for (size_t i = 0; i < buildings.size(); ++i)
    {
        if (x - left == 0)
            return false;

        LL low = 1;
        LL high = min(max_one, x - left);

        while (low < high)
        {
            LL mid = (low + high) / 2;
            right = (i == buildings.size() - 1 ? 0 : x - left - mid);

            if (bc[3][mid] + bc[2][mid] * (left + right) + mid * left * right >= buildings[i])
                high = mid;
            else
                low = mid + 1;
        }

        right = (i == buildings.size() - 1 ? 0 : x - left - high);

        if (bc[3][high] + bc[2][high] * (left + right) + high * left * right < buildings[i])
            return false;

        left += high;
    }

    return true;
}

LL solve(const vector<int>& buildings)
{
    int n = buildings.size();

    if (buildings.size() == 1)
    {
        for (int i = 3; i < MAX_N; ++i)
        {
            if (bc[3][i] >= buildings[0])
                return i;
        }
    }

    int max_one = MAX_N;

    for (int i = 2; i < MAX_N; ++i)
    {
        if (bc[3][i] + bc[2][i] * (n - 1) >= MAX)
        {
            max_one = i;
            break;
        }
    }

    LL low = n + 2;
    LL high = max_one * n;

    while (low < high)
    {
        LL mid = (low + high) / 2;

        if (check(buildings, max_one, mid))
            high = mid;
        else
            low = mid + 1;
    }

    return high;
}

int main()
{
    int t, n, a;
    cin >> t;

    precalculate();

    for (int tt = 0; tt < t; ++tt)
    {
        cin >> n;

        vector<int> buildings;

        for (int nn = 0; nn < n; ++nn)
        {
            cin >> a;

            if (a > 0)
                buildings.push_back(a);
        }

        LL res = solve(buildings);

        cout << res << endl;
    }

    return 0;
}