POJ
来源:互联网 发布:c语言贪吃蛇程序设计 编辑:程序博客网 时间:2024/06/06 07:38
点击打开题目链接
Description
It is very hard to wash and especially to dry clothes in winter. But Jane is a very smart girl. She is not afraid of this boring process. Jane has decided to use a radiator to make drying faster. But the radiator is small, so it can hold only one thing at a time.
Jane wants to perform drying in the minimal possible time. She asked you to write a program that will calculate the minimal time for a given set of clothes.
There are n clothes Jane has just washed. Each of them took ai water during washing. Every minute the amount of water contained in each thing decreases by one (of course, only if the thing is not completely dry yet). When amount of water contained becomes zero the cloth becomes dry and is ready to be packed.
Every minute Jane can select one thing to dry on the radiator. The radiator is very hot, so the amount of water in this thing decreases by k this minute (but not less than zero — if the thing contains less than k water, the resulting amount of water will be zero).
The task is to minimize the total time of drying by means of using the radiator effectively. The drying process ends when all the clothes are dry.
Input
The first line contains a single integer n (1 ≤ n ≤ 100 000). The second line contains ai separated by spaces (1 ≤ ai ≤ 109). The third line contains k (1 ≤ k ≤ 109).
Output
Output a single integer — the minimal possible number of minutes required to dry all clothes.
Sample Input
sample input #132 3 95sample input #232 3 65
Sample Output
sample output #13sample output #22
Source
[Submit] [Go Back] [Status] [Discuss]
二分答案。
①cin超时。
②long long
③特殊判断k为1
④a[i]低于二分时间的跳过,大于二分时间的求time。(time向上取整)
附上AC代码:
#include<iostream>#include<algorithm>#include<cstdio>using namespace std;const int maxn = 100000 + 5;typedef long long ll;ll n, t;ll water[maxn];bool judge(ll mid) {ll time = 0;for (ll i = 0; i < n; i++) {if (water[i] < mid) continue;else {time += (water[i] - mid + ( t - 2 )) / (t - 1);if (time > mid)return false;}}return true;//true:时间少于mid}int main() {scanf("%lld", &n);ll maxd = 0;for (ll i = 0; i < n; i++) {scanf("%lld", &water[i]);maxd = max(maxd, water[i]);}scanf("%lld", &t);if (t == 1) {cout << maxd << endl;}else {ll l = 0, r = maxd, mid;while (r - l > 1) {mid = (r + l) / 2;if (judge(mid)) {r = mid;}else l = mid;}cout << r << endl;}//system("pause");return 0;}
- POJ
- poj
- POJ
- POJ
- poj
- poj
- POJ
- POJ
- poj
- POJ
- POJ
- POJ
- POJ
- POJ
- POJ
- POJ
- POJ
- POJ
- 面向对象与原型三
- 淘淘商城第十二天
- JavaPoet
- Educational Codeforces Round 9 Longest Subsequence 思维+筛法
- 淘淘商城第十三天
- POJ
- mysql数据库从A表查询数据插入到B表中
- Python调试代码的4种方法:print、log、pdb、PyCharm的debug
- 面向对象与原型重难点
- 事件委托与点击事件绑定
- Adjective
- 设计模式-工厂模式 抽象工厂模式 简单工厂模式学习笔记
- AOP之AspectJ
- 虚拟机安装centos7后只有lo网卡的解决办法