We have an array with length N. In an operation we increase M adjacent elements of array by 1. After K operations what is the minimum possible value for the maximum element of array. 1 ≤ N, M ≤ 10^5 1 ≤ K ≤ 10^8
Minimum possible value
We have an array with length N. In an operation we increase M adjacent elements of array by 1. After K operations what is the minimum possible value for the maximum element of array. 1 ≤ N, M ≤ 10^5 1 ≤ K ≤ 10^8