CF #262 （DIV2） C . Present （二分答案）

output

standard output

Little beaver is a beginner programmer, so informatics is his favorite subject. Soon his informatics teacher is going to have a birthday and the beaver has decided to prepare a present for her. He planted n flowers in a row on his windowsill and started waiting for them to grow. However, after some time the beaver noticed that the flowers stopped growing. The beaver thinks it is bad manners to present little flowers. So he decided to come up with some solutions.

There are m days left to the birthday. The height of the i-th flower (assume that the flowers in the row are numbered from 1 to n from left to right) is equal to a_i at the moment. At each of the remaining m days the beaver can take a special watering and water w contiguous flowers (he can do that only once at a day). At that each watered flower grows by one height unit on that day. The beaver wants the height of the smallest flower be as large as possible in the end. What maximum height of the smallest flower can he get?

Input

The first line contains space-separated integers n, m and w (1 ≤ w ≤ n ≤ 10⁵; 1 ≤ m ≤ 10⁵). The second line contains space-separated integers a₁, a₂, ..., a_n (1 ≤ a_i ≤ 10⁹).

Output

Print a single integer — the maximum final height of the smallest flower.

Sample test(s)

Input

6 2 3
2 2 2 2 1 1

Output

2

Input

2 5 1
5 8

Output

9

二分最终的结果，然后判断是否合法。即在当前的最终最大的高度下，是否m次可以达到。

#include <iostream>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <set>
#include <stack>
#include <cctype>
#include <algorithm>
#define lson o<<1, l, m
#define rson o<<1|1, m+1, r
using namespace std;
typedef long long LL;
const int mod = 99999997;
const int MAX = 2000000000;
const int maxn = 300005;
LL n, m, w;
LL sum[maxn], a[maxn];
bool ok(LL mi) {
    memset(sum, 0, sizeof(sum));
    LL cur, cnt = 0;
    for(int i = 0; i < n; i++) {
        if(i > 0) sum[i] += sum[i-1];
        cur = sum[i] + a[i];
        if(cur < mi) {
            cnt += mi - cur;
            sum[i] += mi - cur;
            sum[i+w] -= mi - cur;
        }
    }
    if(cnt > m) return true;
    return false;
}
int main()
{
    cin >> n >> m >> w;
    for(int i = 0; i < n; i++) cin >> a[i];
    LL l = 0, r = MAX;
    while(r - l > 1) {
        LL mid = (l+r) >> 1;
        if(ok(mid)) r = mid;
        else l = mid;
    }
    cout << l << endl;
    return 0;
}