链接:https://ac.nowcoder.com/acm/contest/5675/E
来源:牛客网
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<string>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<time.h>
#include<vector>
#include<cmath>
using namespace std;
long long sum = 0,ans = 0;
int a;
int p;
int main()
{
int n,t;
scanf("%d",&t);
while(t--){
sum = ans = 0;
scanf("%d",&n);
for(int i=0; i<n; ++i){
scanf("%d",&a);
sum+=a;
p = ceil((sum+0.0)/(i+1));
if(p>ans)
ans = p;
}
printf("%lld\n",ans);
}
return 0;
}