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
#include <bits/stdc++.h>
#define debug(x) cout<<#x<<" = "<<x<<"\n"
//#define debug(x) x
#define pb push_back
#define ins insert
#define fi first
#define se second
 
using namespace std;
using ull = unsigned long long;
using ll = long long;
using ld = long double;
 
template <typename H, typename T> 
ostream& operator<<(ostream& os, pair<H, T> m){
	return os <<"("<< m.fi<<", "<<m.se<<")";
}
 
template <typename H> 
ostream& operator<<(ostream& os, vector<H> V){
	os<<"{";
	for(int i=0; i<V.size(); i++){
		if(i)os<<" ";
		os<<V[i];
	}
	os<<"}";
	return os;
}
 
void solve();


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

	int t = 1;
	cin>>t;
	while(t--) {

		solve();
	}


	return 0;
}



ll a[200000+50];


void solve(){
	int n;
	cin>>n;
	for(int i = 1; i<= n; i++){
		cin>>a[i];
	}
	ll low = 0;
	ll high = 105 * 200001;
	ll mid = (low + high)/2;
	while(high-low>1){
		ll budzet = mid;
		ll wyk = 0;
		bool ok = true;
		for(int i = 1; i <= n; i++){
			ll x = 0;
			//debug(i);
			while(x*(x-1)*(x-2)/6 + (wyk+budzet)*x*(x-1)/2 + wyk * budzet * x < a[i]){
				x++;
				//debug(x);
				budzet--;
				if(budzet < 0) break;
			}
			if(budzet < 0){
				ok = false;
				break;
			}
			wyk += x;
		}
		if(ok) high = mid;
		else low = mid;
		mid = (low+high)/2;

	}
	cout<<high<<"\n";















}