C - Present

C - Present

Time Limit:2000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

Submit Status Practice CodeForces 460C

Description

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 wcontiguous 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 Input

Input

6 2 3
2 2 2 2 1 1

Output

2

Input

2 5 1
5 8

Output

9

先说题意：共有n盆花列为一排，输入n盆花的现高度，可浇水m天，每天只能浇一次，每次浇水只能浇相邻的w株，每浇水一次花长高1，求m天后最矮的花最高为多少。

可用二分答案的方法，将可能的高度二分，再比较在m天内能不能达到二分的数值，若能则继续向上二分答案，若不能则向下二分答案，直到找出最合适的值。

附AC代码：

#include<iostream>
#include<cstdio> 
#include<cmath>
#include<cstring>
#include<algorithm>
using namespace std;

const int MAX=101000;
long long a[MAX],b[MAX],v[MAX];

int main(){
    int n,m,w;
    while(~scanf("%d %d %d",&n,&m,&w)){
        long long low=1e9,top=-1;
        for(int i=1;i<=n;i++){
            scanf("%I64d",&a[i]);
            if(a[i]<low)
            low=a[i];
            if(a[i]>top)
            top=a[i];
        }
        top+=m;
        long long mid,ans=-1;
        while(top>=low){
            mid=(top+low)/2;//中点 
            for(int i=1;i<=n;i++)
                b[i]=max(mid-a[i],(long long)0);//到达中点所需要的天数 
                memset(v,0,sizeof(v));//v数组用来实现连续浇水w 
                long long day=m;//day表示天数 
                long long c=0;//已浇水天数 
                for(int i=1;i<=n;i++){
                    c+=v[i];//w个后c归零 
                    b[i]-=c;//已浇c天 
                    if(b[i]>0){
                        day-=b[i];
                        if(day<0)//天数不够 
                        break;
                        else
                        c+=b[i];
                        v[i+w]-=b[i];//当i循环到w个后时，这些花之前并没有被浇水，所以减去，由循环开头式子得c=0 
                        b[i]=0;//已交够水了所以为0 
                    }
                }
                if(day<0){//当天数不够时向下二分答案 
                    top=mid-1;
                }
                else{//继续向上二分 
                    ans=mid;
                    low=mid+1;
                }
        }
        printf("%I64d\n",ans);
    }
    return 0;
}