思路：
- 题意：将右侧木块香左推动，求得最后所有列的max的最小值。
- 官方题解：(记着上取整)
代码实现：
#include<bits/stdc++.h>
#define endl '\n'
#define null NULL
#define ll long long
#define int long long
#define pii pair<int, int>
#define lowbit(x) (x &(-x))
#define ls(x) x<<1
#define rs(x) (x<<1+1)
#define me(ar) memset(ar, 0, sizeof ar)
#define mem(ar,num) memset(ar, num, sizeof ar)
#define rp(i, n) for(int i = 0, i < n; i ++)
#define rep(i, a, n) for(int i = a; i <= n; i ++)
#define pre(i, n, a) for(int i = n; i >= a; i --)
#define IOS ios::sync_with_stdio(0); cin.tie(0);cout.tie(0);
const int way[4][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
using namespace std;
const int inf = 0x7fffffff;
const double PI = acos(-1.0);
const double eps = 1e-6;
const ll mod = 1e9 + 7;
const int N = 2e5 + 5;
int t, n, sum, ans, cnt;
signed main()
{
IOS;
cin >> t;
while(t --){
cin >> n;
ans = sum = cnt = 0;
while(++ cnt <= n){
int x; cin >> x;
sum += x;
ans = (cnt==1 ? x : max(ans, sum/cnt + (sum%cnt!=0)));
}
cout << ans << endl;
}
return 0;
}