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
#include <bits/stdc++.h>
using namespace std;
#define st first
#define nd second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define BOOST ios_base::sync_with_stdio(0), cin.tie(0)
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;

const int N = 2e5 + 5;
int t[N];
int n;

ll f(int l, int m, int r){
	return (ll)m*(m-1)*(m-2)/6 + (ll)m*(m-1)/2 * (l+r) + (ll)l*m*r;
}

bool go(int x){
	int sum = 0;
	for(int i=0; i<n; i++){
		int l = -1, r = min(183, x-sum);
		while(r - l > 1){
			int mid = (l+r)/2;
			f(sum, mid, x-sum-mid) >= t[i] ? r = mid : l = mid;
		}
		if(f(sum, r, x-sum-r) < t[i]) return false;
		sum += r;
	}
	return true;
}

void solve(){
	cin >> n;
	for(int i=0; i<n; i++){
		cin >> t[i];
	}
	int l = -1, r = 183*n;
	while(r - l > 1){
		int mid = (l+r)/2;
		go(mid) ? r = mid : l = mid;
	}
	cout << r << "\n";
}

int main(){
	BOOST;
	int q; cin >> q;
	while(q--){
		solve();
	}
}