POJ 3104 Drying Clothes
来源:互联网 发布:淘小白自动发货软件 编辑:程序博客网 时间:2024/05/29 07:36
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 32 3 95 sample input #2 32 3 65
Sample Output
sample output #1 3 sample output #2 2
二分答案,先假设全部自然晾干,对于还余下的水分需要使用烘干机ceil(x*1.0/(k-1))次,看是否符合要求次数(时间)。
注意:分母为0要单独讨论。整形时会运行时错误,但实型不会报错,返回一个很大的数(inf)。
#include <iostream>#include<cmath>#include<cstdio>using namespace std;int a[100100],k,ma;int n;long long check(long long t){ long long i,j,ans=0; for (i=1;i<=n;i++){ long long x; x=a[i]-t; if (x>0) ans+=ceil(x*1.0/(k-1)); } if (ans<=t) return 1; else return 0;}long long bse(){ long long l,r,m,i,j; l=1;r=ma;m=(l+r)/2; while (l<r){ if (check(m)) r=m; else l=m+1; m=(l+r)/2; } return m;}int main(){ long long i; scanf("%d",&n); ma=0; for (i=1;i<=n;i++) { scanf("%d",&a[i]); ma=max(ma,a[i]); } scanf("%d",&k); if (k==1) printf("%d\n",ma); else printf("%d\n",bse()); return 0;}
- POJ 3104 Drying Clothes
- 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-二分
- POJ-3104Drying
- POJ 3104 Drying(二分)
- POJ 3104 Drying
- JTextArea DEMO
- HDU 1004
- 开源 java CMS - FreeCMS2.3会员我的收藏
- 周鸿祎的一段话,让我受益匪浅
- 线程安全C/C++ http://blog.csdn.net/huangxy10/article/details/8068653
- POJ 3104 Drying Clothes
- 四元数与欧拉角(yaw roll pitch)转换公式与推导,以及它们unity中的不同
- hd1272 小希的迷宫
- iOS 设计模式之中介者模式
- 同步非阻塞I/O——NIO(一)基于文件操作
- POJ_1426_FindTheMultiple
- 脏读(dirty read)不可重复读(unrepeatable read)幻读(phantom problem)解析
- hdu 5317 RGCDQ 2015 Multi-University Training Contest 3
- eclipse tomcat插件