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
#include <bits/stdc++.h>
using namespace std;
#define fwd(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n)    fwd(i, 0, n)
#define all(X)       X.begin(), X.end()
#define sz(X)        int(size(X))
#define pb           push_back
#define eb           emplace_back
#define st           first
#define nd           second
using pii = pair<int, int>;
using vi = vector<int>;
using ll = long long;
using ld = long double;
#ifdef LOC
auto SS = signal(6, [](int) {
	*(int *)0 = 0;
});
#	define DTP(x, y)                                      \
		auto operator<<(auto &o, auto a)->decltype(y, o) { \
			o << "(";                                      \
			x;                                             \
			return o << ")";                               \
		}
DTP(o << a.st << ", " << a.nd, a.nd);
DTP(for (auto i : a) o << i << ", ", all(a));
void dump(auto... x) {
	((cerr << x << ", "), ...) << '\n';
}
#	define deb(x...) cerr << setw(4) << __LINE__ << ":[" #x "]: ", dump(x)
#else
#	define deb(...) 0
#endif

void sol() {
	int n;
	cin >> n;
	vi a;
	rep(i, n) {
		int x;
		cin >> x;
		if (x)
			a.pb(x);
	}
	n = sz(a);

	auto ok = [&](ll k) -> bool {
		ll used = 0;
		rep(i, n) {
			ll left_over = k - used;
			ll left = i;
			ll right = n - i - 1;
			ll L = 0, R = left_over, ans = -1;
			while (L <= R) {
				ll M = (L + R) / 2;
				ll need = a[i];
				ll mid = M + 1;
				ll real_left = left + used;
				ll real_right = right + left_over - M;
				ll combs = 0;
				combs += real_left * real_right * mid;
				combs += mid * (mid - 1ll) / 2ll * (real_left + real_right);
				combs += mid * (mid - 1ll) * (mid - 2ll) / 6ll;
				if (combs >= need) {
					ans = M;
					R = M - 1;
				} else
					L = M + 1;
			}
			if (ans == -1)
				return false;
			used += ans;
		}
		return true;
	};

	ll L = 0, R = 2000, ans = -1;
	while (L <= R) {
		ll M = (L + R) / 2;
		if (ok(M)) {
			ans = M;
			R = M - 1;
		} else
			L = M + 1;
	}
	assert(ans != -1);
	cout << ans + n << '\n';
}

int32_t main() {
	cin.tie(0)->sync_with_stdio(0);
	cout << fixed << setprecision(10);
	int t;
	cin >> t;
	rep(i, t) sol();
#ifdef LOCF
	cout.flush();
	cerr << "- - - - - - - - -\n";
	(void)!system(
		"grep VmPeak /proc/$PPID/status | sed s/....kB/\' MB\'/1 >&2"); // 4x.kB
																		// ....kB
#endif
}