Codeforces Round #262 (Div. 2) C. Present

C. Present

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

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

Note

In the first sample beaver can water the last 3 flowers at the first day. On the next day he may not to water flowers at all. In the end he will get the following heights: [2, 2, 2, 3, 2, 2]. The smallest flower has height equal to 2. It's impossible to get height 3 in this test.

题目意思：

题目：给你n朵花的高度，然后给你m天，每天你能给连续w朵花浇一次水，花被浇一次水高度就加一，问你使所有花尽可能的大，输出尽可能大的方案里高度最小的那朵花；思路：一般二分去写这题，二分这个最小高度，然后判断这个最小高度是否符合情况。线段树也可以通过此题，这是后来看的别人的思路，挺好的，好好总结总结。

代码如下：

#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <cstdio>
using namespace std;
#define maxn 100000
#define inf 999999
long long a[maxn];
long long mm[4*maxn];
int setv[4*maxn];

void build(int root, int l, int r)
{
    int lc = 2*root, rc = 2*root+1;
    if(l < r)
    {
        int mid = (l+r)/2;
        build(2*root, l, mid);
        build(2*root+1, mid+1, r);
        mm[root] = min(mm[lc], mm[rc]);
    }
    else
    {
        mm[root] = a[l];
    }
}

void pushdown(int root, int l, int r)
{
    int lc = 2*root, rc = 2*root+1;
    if(setv[root] > 0)
    {
        setv[lc] += setv[root];
        setv[rc] += setv[root];
        mm[lc] += setv[root];
        mm[rc] += setv[root];
        setv[root] = 0;
    }
}

void pushup(int root, int l, int r)
{
    int lc = 2*root, rc = 2*root+1;
    mm[root] = min(mm[lc], mm[rc]);
}

void modify(int root, int l, int r, int x, int y, int s)
{
    if(x <= l && r <= y)
    {
        mm[root] += s;
        setv[root] += s;
    }
    else
    {
        pushdown(root, l, r);
        int mid = (l+r)/2;
        if(x <= mid) modify(2*root, l, mid, x, y, s);
        if(y > mid) modify(2*root+1, mid+1, r, x, y, s);
        pushup(root, l, r);
    }
}

int minn;
void query(int root, int l, int r, int z)
{
    int lc = 2*root, rc = 2*root+1 , mid = (l+r)/2;
    if(l == r)
    {
        if(l < minn) minn = l;
    }
    else
    {
        pushdown(root, l, r);
        if(mm[lc] <= z) query(lc, l, mid, z);
        else query(rc, mid+1, r, z);
        pushup(root, l, r);
    }
}

void print(int root, int l, int r)
{
    printf("%d %d\n", root, mm[root]);
    if(l < r)
    {
        int mid = (l+r)/2;
        print(2*root, l, mid);
        print(2*root+1, mid+1, r);
    }
}

int main()
{
    int w, n, m;
    scanf("%d%d%d", &n, &m, &w);
    for(int i = 1; i <= n; i ++)
        scanf("%d", &a[i]);
    memset(setv, 0, sizeof(setv));
    build(1, 1, n);
    for(int i = 1; i <= m; i ++)
    {
        minn = inf;
        query(1, 1, n, mm[1]);
        if(n-minn+1 < w) modify(1, 1, n, n-w+1, n, 1);
        else modify(1, 1, n, minn, minn+w-1, 1);
    }
    printf("%I64d\n", mm[1]);
    return 0;
}