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

using namespace std;

typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pii;

#define FOR(x, b, e) for(int x = (b); x <= (e); ++(x))
#define FORD(x, b, e) for(int x = (b); x >= (e); --(x))
#define REP(x, n) for(int x = 0; x < (n); ++x)
#define ALL(c) (c).begin(), (c).end()
#define SIZE(x) ((int)(x).size())
#define FOREACH(a, b) for (auto&a : (b))
#define PB push_back
#define PF push_front
#define ST first
#define ND second
#define DBG(vari) cerr<<#vari<<" = "<<(vari)<<endl

template <typename T>
std::ostream& operator<<(std::ostream &output, const vector<T> &vec)
{
    output << "[";
    FOREACH(x, vec) output << x << ", ";
    output << "]";
    return output;
}

template <typename T, typename U>
std::ostream& operator<<(std::ostream &output, const pair<T,U> &p)
{
    output << "(";
    output << p.ST << ", " << p.ND;
    output << ")";
    return output;
}

bool sprawdz(vi& a, ll m) {
  ll c = 0;
  REP(i, SIZE(a)) {
    if (a[i] == 0) continue;

    ll mn = 1e9;

    FOR(x, 1, min(200LL,m)) {
      if (i == 0) {
        if ((m-x)*x*(x-1)/2 + x*(x-1)*(x-2)/6 >= a[i]) {
          mn = x;
          break;
        }
      }
      else
      {
        FOR(q, 0, 200) {
          auto p = c + q;

          if (x + p > m) break;

          if (p*(m-x-p)*x + (m-x)*x*(x-1)/2 + x*(x-1)*(x-2)/6 >= a[i]) {
            mn = min(mn, x + p);  
            break;
          }
        }
      }

      if (x*(x-1)*(x-2)/6 >= a[i])
        break;
    }

    c = mn;
    //DBG(i);
    //DBG(c);
  }
  return c <= m;
}


int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);

  //vi a({0, 3, 4, 3, 0});
  //ll m = 5;

  //vi a({1});
  //ll m = 3;
  
  //vi a({57});
  //ll m = 9;
  
  //vi a({4, 4});
  //ll m = 6;
  
/*

  vi a({0, 3, 5, 3, 0});
  ll m = 6;

  if (sprawdz(a, m)) {
    cout << "TAK" << endl;
  }
  else
  {
    cout << "NIE" << endl;
  }
*/

  int t; cin >> t;

  while (t--) {
    int n; cin >> n;   
    vi a(n); REP(i, n) cin >> a[i];

    ll m=0;
    FORD(k, __lg(n*200), 0) {
      if (!sprawdz(a, m + (1<<k))) {
        m += (1<<k);   
      }
    }

    if (!sprawdz(a, m))
      m++;

    cout << m << endl;

  }

}