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

#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define all(x) begin(x), end(x)
#define sz(x) int((x).size())
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;

#ifdef LOCAL
auto operator<<(auto& o, auto x) -> decltype(x.first, o);
auto operator<<(auto& o, auto x) -> decltype(x.end(), o) {
  o << "{";
  for (int i = 0; auto y : x) o << ", " + !i++ * 2 << y;
  return o << "}"; }
auto operator<<(auto& o, auto x) -> decltype(x.first, o) {
  return o << "(" << x.first << ", " << x.second << ")"; }
void __print(auto... x) { ((cerr << x << " "), ...) << endl; }
#define debug(x...) __print("[" #x "]:", x)
#else
#define debug(...) 2137
#endif

const int N = 200200;
int n;
int a[N];

void solve() {
  cin >> n;
  rep(i, 0, n) cin >> a[i];
  int lo = 1;
  int hi = n + 2000;
  while (lo < hi) {
    int mid = (lo + hi) / 2;
    int ile = 0;
    rep(i, 0, n) if (a[i]) {
      ll x = 1;
      auto ok = [&]() {
         return x * (x - 1) * (x - 2) / 6 +
                x * (x - 1) / 2 * (mid - x) +
                x * ile * (mid - ile - x) >= a[i];
      };
      while (ile + x < mid && !ok()) x++;
      if (ile + x <= mid && ok()) {
        ile += x;
      } else {
        ile = mid + 1;
        break;
      }
    }
    if (ile <= mid) hi = mid;
    else lo = mid + 1;
  }
  cout << lo << '\n';
}

int main() {
  cin.tie(0)->sync_with_stdio(0);
  int t;
  cin >> t;
  while (t--) solve();
}