leetcode

0 class Solution {

1 public:

2 int minimizeArrayValue(vector<int> &nums) {

3 long sum = 0, res = 0;

4 for (int i = 0; i < nums.size(); ++i) {

5 sum += nums[i];

6 res = max(res, (sum + i) / (i + 1));

7 }

8 return res;

9 }

10 };