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
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
ll a[200200];
int n;
void solve()
{
	cin>>n;
	for(int i=1;i<=n;i++)
		cin>>a[i];
	ll L=0,R=2e6;
	while(L<R)
	{
		ll MID=(L+R)/2;
		ll s=0;
		for(int i=1;i<=n;i++)
		{
			ll l=s,r=MID+1;
			while(l<r)
			{
				ll mid=(l+r)/2;
				ll cnt=(mid*(mid-1)/2-s*(s-1)/2)*(MID-mid)+(mid-s)*(mid-s-1)/2*s+(mid-s)*(mid-s-1)*(mid-s-2)/6;
				if(cnt>=a[i])
					r=mid;
				else
					l=mid+1;
			}
			s=l;
			if(s>MID)
				break;
		}
		if(s>MID)
			L=MID+1;
		else
			R=MID;
	}
	cout<<L<<'\n';
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int t;
	cin>>t;
	while(t--)
		solve();
	return 0;
}