2439. Minimize Maximum of Array

You are given a 0-indexed array nums comprising of n non-negative integers.

In one operation, you must:

• Choose an integer i such that 1 <= i < n and nums[i] > 0.
• Decrease nums[i] by 1.
• Increase nums[i - 1] by 1.

Return the minimum possible value of the maximum integer of nums after performing any number of operations.

class Solution {
public:
    int minimizeArrayValue(vector<int>& nums) {
        long long sum = 0, res = 0, cnt = 0;
        for(auto n : nums) {
            sum += n;
            cnt += 1;
            res = max(res, (sum + cnt - 1) / cnt);
        }
        return res;
    }
};