设为首页 加入收藏

TOP

Codeforces Round #262 (Div. 2) A,B,C(二)
2015-07-20 17:51:56 来源: 作者: 【 】 浏览:11
Tags:Codeforces Round #262 Div.
). 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.





首页 上一页 1 2 下一页 尾页 2/2/2
】【打印繁体】【投稿】【收藏】 【推荐】【举报】【评论】 【关闭】 【返回顶部
分享到: 
上一篇C++11 新特性(5) 统一初始化 下一篇hdu 4578 Transformation

评论

帐  号: 密码: (新用户注册)
验 证 码:
表  情:
内  容: