Codeforces 460C Present

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 ai 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 ≤ 105; 1 ≤ m ≤ 105). The second line contains space-separated integers a1, a2, …, an (1 ≤ ai ≤ 109).

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

解题思路：二分枚举这个最小高度，然后对于相应的高度，我们判断验证是否存在一种浇花的方案使得满足条件。验证方案是否可行的时候我们需要借用树状数组进行优化，代码如下。

#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
const int maxn = 100010;
int tree[maxn];
int a[maxn];
int n, m, w;

int lowbit(int x) {
    return x & (-x);
}

void add(int x, int c) {
    for(int i = x; i > 0; i -= lowbit(i)) {
        tree[i] += c;
    }
}

int sum(int x) {
    int s = 0;
    for(int i = x; i <= n; i += lowbit(i)) {
        s += tree[i];
    }
    return s;
}


bool check(int x) {

    memset(tree, 0, sizeof(tree));
    for(int i = 1; i <= n; ++i) {
        add(i-1, -a[i]);
        add(i, a[i]);
    }
    int tot = m;
    for(int i = 1; i <= n; ++i) {
        int t = sum(i);
        if(t >= x) {
            continue;
        } else {
            if(tot < x - t) {
                return false;
            } else {
                if(x - t == 0) continue;
                tot -= (x - t);
                add(i - 1, -(x-t));
                add(min(i+w-1, n), x-t);
            }
        }
    }
    return true;
}

int main() {

    //freopen("aa.in", "r", stdin);
    int l, r, mid;
    int ans = 0;
    int maxh = 0, minh = 0x3f3f3f3f;
    scanf("%d %d %d", &n, &m, &w);
    for(int i = 1; i <= n; ++i) {
        scanf("%d", &a[i]);
        maxh = max(maxh, a[i]);
        minh = min(minh, a[i]);
    }
    l = minh;
    r = maxh + m;
    while(l <= r) {
        mid = (l + r) / 2;
        if(check(mid)) {
            ans = max(ans, mid);
            l = mid + 1;
        } else {
            r = mid - 1;
        }
    }
    printf("%d\n", ans);
    return 0;
}