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
#include<set>
#include<map>
#include<queue>
#include<vector>
#include<algorithm>
#include<bits/stdc++.h>
#define pr pair
#define f first
#define s second
#define ll long long
#define mp make_pair
#define pll pr<ll,ll>
#define pii pr<int,int>
#define piii pr<int,pii>
using namespace std;
ll a[200005];
void sl()
{
	int n;
	cin>>n;
	for(int i=0;i<n;i++) cin>>a[i];
	ll l=-1,m,r=2000000;
	while(l<r-1)
	{
		m=l+r>>1;
		ll cd=0;
		bool ok=1;
		for(int i=0;i<n;i++)
		{
			ll cl=-1,cm,cr=m-cd+1;
			while(cl<cr-1)
			{
				cm=cl+cr>>1;
				ll v=cm*(cm-1)*(cm-2)/6+cm*(cm-1)/2*(m-cm)+cd*cm*(m-cm-cd);
				if(v>=a[i]) cr=cm;
				else cl=cm;
			}
			if(cr==m-cd+1)
			{
				ok=0;
				break;
			}
			cd+=cr;
		}
		if(ok) r=m;
		else l=m;
	}
	cout<<r<<endl;
}
int main()
{
	ios_base::sync_with_stdio(0);
	int t;
	cin>>t;
	while(t--) sl();
	return 0;
}