POJ 3104 Drying
来源:互联网 发布:java获取标准北京时间 编辑:程序博客网 时间:2024/06/06 20:30
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 #1
3
2 3 9
5
sample input #2
3
2 3 6
5
Sample Output
sample output #1
3
sample output #2
2
思路:二分。WA半天。
启示是:
- 数据多,别用cin读。
- 注意k=1的情况
- sum要用long long来存
代码:
#include <cstdio>#include <iostream>#include <cstring>#include <vector>#include <map>#include <string>#include <cstring>#include <cmath>#include <algorithm>#include <climits>using namespace std;int k,n,t[100000+10];int check(int m){ long long sum=0; for(int i=1;i<=n;i++) { if(t[i]>m) { if(k==1) return 0; sum+=ceil((double)(t[i]-m)/(k-1)); if(sum>m) return 0; } } if(sum>m) return 0; return 1;}int main(void){ #ifdef LOCAL freopen("in.txt","rb",stdin); //freopen("out.txt","wb",stdout); #endif // LOCAL cin >> n; int l=0,r=0; for(int i=1;i<=n;i++) { scanf("%d",&t[i]); r=max(t[i],r); } cin >> k; while(r-l>1) { int m=(l+r)/2; if(check(m)) r=m; else l=m; } printf("%d",check(l)?l:r); return 0;}
- POJ 3104 Drying 二分
- 二分法 POJ-3104 Drying
- POJ--3104--Drying【二分】
- POJ 3104 Drying
- POJ-3104 Drying
- POJ 3104 Drying 二分
- poj 3104 Drying (二分)
- POJ-3104-Drying
- POJ 3104 Drying
- POJ 3104 Drying (二分)
- POJ 3104 Drying (二分)
- Poj 3104 Drying
- POJ 3104 Drying
- POJ 3104 Drying Clothes
- POJ 3104- Drying-二分
- POJ-3104Drying
- POJ 3104 Drying(二分)
- POJ 3104 Drying
- 向量,矩阵,数组,数据框图解
- channel
- 愿你我这样做人
- 做网站上线
- 出现 -bash: setup: command not found
- POJ 3104 Drying
- 深度学习( Deep Learning )资源库列表
- 简单枚举(UVA725、UVA11057、UVA10976)
- js中2个等号与3个等号的区别
- JSON.parse()和JSON.stringify()
- 个人学习笔记
- python dict 方法
- 复习—基本知识-变量和基本类型
- php 计算两天之间的事件差,具体为 几天几小时几分钟