#include <bits/stdc++.h>
using namespace std;
const int N = 1e5+5;
typedef long long ll;
int a[N],n;
ll sum[N];
bool check(int hei) {
	ll rem = 0;
	for (int i = n;i>= 1;i--) {
		if (a[i]>hei)rem+=a[i]-hei;
		if (a[i]<hei)rem=max(0ll,rem-hei+a[i]);
		if (rem != 0 && rem > (ll)hei*(i-1)-sum[i-1])return false;
	}
	return true;
}
int main() {
	int cas;
	scanf("%d",&cas);
	while (cas--) {
		scanf("%d",&n);
		for (int i = 1;i<= n;i++)
		{
			scanf("%d",&a[i]);
			sum[i] = sum[i-1]+a[i];
		}
		int l = 1,r = 1e9+5;
		while (l<r) {
			int mid = (l+r)>>1;
			if (check(mid))r = mid;
			else l = mid+1;
		}
		printf("%d\n",l);
	}
	return 0;
}