Present

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

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.
这个题和以前做的周赛的一道题很类似,尤其是在二分判断结果的时候用来记录花朵长高的长度s[i]+=h,s[i+w]-=h;可以算出在前面花朵浇水后的长高的长度

#include <cstring>
#include <cstdio>
#include <stack>
#include <map>
#include <set>
#include <cmath>
#include <cstdlib>
#include <string>
#include <queue>
#include <iostream>
#include <algorithm>

using namespace std;

const int  INF = 0x3f3f3f3f;

const long long  MAXN = 1e14;

const int MAX =1e6+100;

int a[MAX];

long long s[MAX];

int n,w,m;

bool OK(long long mid)
{
    memset(s,0,sizeof(s));
    long long sum=0;
    long long num=0;
    long long ans;
    for(int i=0; i<n; i++)
    {
        sum+=s[i];
        if(mid>a[i]+sum)
        {
            ans=(mid-a[i]-sum);
            num+=(mid-a[i]-sum);
            sum+= (mid-a[i]-sum);
            if(i+w>=n)
            {
                s[n]-=ans;
            }
            else
            {
                s[i+w]-=ans;
            }
        }
        if(num>m)
        {
            return false;
        }
    }
    return true;
}

int main()
{

    scanf("%d %d %d",&n,&m,&w);
    for(int i=0; i<n; i++)
    {
        scanf("%d",&a[i]);
    }
    long long high=0;
    long long L=1,R=MAXN;
    while(L<=R)
    {
        long long mid=(L+R)>>1;
        if(OK(mid))
        {
            high=max(high,mid);
            L=mid+1;
        }
        else
        {
            R=mid-1;
        }
    }
    printf("%I64d\n",high);

    return 0;
}

转载于:https://www.cnblogs.com/juechen/p/5255999.html