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
#include<bits/stdc++.h>
using namespace std;
using LL=long long;
#define FOR(i,l,r)for(int i=(l);i<=(r);++i)
#define REP(i,n)FOR(i,0,(n)-1)
#define ssize(x)int(x.size())
#ifdef DEBUG
auto operator<<(auto&o,auto x)->decltype(x.end(),o);
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto&operator<<(auto&o,tuple<auto,auto,auto>t){return o<<"("<<get<0>(t)<<", "<<get<1>(t)<<", "<<get<2>(t)<<")";}
auto&operator<<(auto&o,tuple<auto,auto,auto,auto>t){return o<<"("<<get<0>(t)<<", "<<get<1>(t)<<", "<<get<2>(t)<<", "<<get<3>(t)<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif

void solve() {
	int n;
	cin >> n;
	vector<int> a(n);
	REP(i, n)
		cin >> a[i];
	debug(n, a);

	auto is_okay = [&](LL total) {
		int pref = 0;
		auto f = [&](LL x) {
			return x * (x - 1) * (x - 2) / 6 + max(0ll, x * (x - 1) / 2 * (total - x)) + max(0ll, x * pref * (total - pref - x));
		};
		REP(i, n) {
			int x = 0;
			while (f(x) < a[i])
				++x;
			pref += x;
			if (pref > total) {
				return false;
			}
		}
		return true;
	};
	int bb = 0, ee = 1e6 + 10;
	while (ee - bb > 1) {
		int ss = (bb + ee) / 2;
		if (is_okay(ss))
			ee = ss;
		else
			bb = ss;
	}
	cout << ee << '\n';
}

int main() {
	cin.tie(0)->sync_with_stdio(0);

	int t;
	cin >> t;
	REP(tt, t)
		solve();
}