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.

``````#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;
}
``````

Present的更多相关文章

1. 跳转时候提示Attempt to present on while a presentation is in progress

出现这种情况,例如:我在获取相册图片后,直接present到另一个页面,但是上一个页面可能还未dismiss,所以,要在获取相册图片的dismiss方法的complete的block里面写获取图片及跳 ...

find your present (2) Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Ot ...

3. HTTP Status 400 - Required String parameter &#39;userName&#39; is not present 错误

HTTP Status 400 - Required String parameter 'userName' is not present 错误 先mark  有时间详细写 参考链接: https:/ ...

4. Linux 克隆虚拟机引起的&ldquo;Device eth0 does not seem to be present, delaying initialization&rdquo;

虚拟机Vmware上克隆了一个Red Hat Enterprise Linx启动时发现找不到网卡,如下所示,如果你在命令窗口启动网络服务就会遇到"Device eth0 does not s ...

5. required string parameter XXX is not present

@RequestParam jQuery调用方式: deleteFile: function(filePath) { return ajax({ method: 'POST', url: '/cm/s ...

6. 启动网卡报:Device eth0 does not seem to be present”解决办法

Device eth0 does not seem to be present”解决办法 : 用ifconfig查看发现缺少eth0,只有lo:用ifconfig -a查看发现多出了eth1的信息. ...

7. jQuery 跨域访问的三种方式 No &#39;Access-Control-Allow-Origin&#39; header is present on the reque

8. js跨域访问，No &#39;Access-Control-Allow-Origin&#39; header is present on the requested resource

9. sudo: no tty present and no askpass program specified(转)

sudo: no tty present and no askpass program specified 2012-11-30 09:30 5040人阅读 评论(1) 收藏 举报 修改sudo配置文 ...

10. 虚拟机解决Device eth0 does not seem to be present 问题。

Device eth0 does not seem to be present... 出现这个问题基本上是因为虚拟机是克隆的导致机器的mac网卡不一致,所以系统识别网卡失败:

随机推荐

1. PHP描述冒泡排序和快速排序算法

使用PHP描述冒泡排序和快速排序算法,对象可以是一个数组.使用PHP描述顺序查找和二分查找(也叫做折半查找)算法,顺序查找必须考虑效率,对象可以是一个有序数组.写一个二维数组排序算法函数,能够具有通用 ...

2. 【spring 配置文件】spring配置文件的解析

一.总体结构 二.详解 1.spring <alias >标签 在对bean进行定义时,除了使用id属性来指定名称之外,为了提供多个名称,可以使用alias标签来指定.而所有的这些名称都指 ...

3. JSTL Tag学习笔记(二)之&lt;fmt: /&gt;

JSTL的formatting tags可以用来格式化和显示文本.日期.时间.数字.如果在JSP页面中要用到该库提供的tag的话,需要引入如下taglib: <%@ taglib prefix= ...

4. MySQL中间层 Atlas

Atlas是由 Qihoo 360,  Web平台部基础架构团队开发维护的一个基于MySQL协议的数据中间层项目.它在MySQL官方推出的MySQL-Proxy 0.8.2版本的基础上,修改了大量bu ...

5. jquery的effect-color对easyui没效果.自己冒险写个边框的颜色闪烁.

"jquery-ui-effect-color.js" 是从jqueryui下载的color动画部分(自己改了个名字). 链接 <!DOCTYPE html> < ...

6. mac中的xampp配置xdebug

[xdebug] zend_extension=/Applications/XAMPP/xamppfiles/lib/php/extensions/no-debug-non-zts-20121212/ ...

7. Day14 html简介

初识html <!DOCTYPE html> <html lang="en"> <head> <!--自闭合标签--> <me ...

8. atx-agent minicap、minitouch源码分析

项目描述: 因为公司需要,特别研究了一下openatx系列手机群控源码 源码地址: https://github.com/openatx 该项目主要以go语言来编写服务端.集成 OpenSTF中核心组 ...

9. [jquery.validate]自定义方法实现&quot;手机号码或者固定电话&quot;的逻辑验证

最近项目开发中遇到这样的需求“手机号码或者固话至少填写一个”,如下图所示: 项目采用的jquery.validate.js验证组件,目前组件不支持这种“或”逻辑的验证,于是就自己定义一个 jQuery ...

10. Sqlserver还原master

net stop mssqlserver net start mssqlserver /m"SQLCMD" sqlcmd -s xx sqlcmd -s xx -U sa -P x ...