POJ3104(二分搜索)
2016-07-17 16:30
337 查看
Drying
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 kwater, 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 Output
Time Limit: 2000MS | Memory Limit: 65536K | |
Total Submissions: 13057 | Accepted: 3358 |
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 kwater, 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 思路:二分minute。设每个clothes所需y次烘干,那么就有minute-y次自然干。minute-y+y*k>=x[i]。解y>=(x[i]-minute)/(k-1)。注意k等于1的情况。
#include <cstdio> #include <algorithm> #include <math.h> using namespace std; const int MAXN=100005; int n,k; int x[MAXN]; bool test(int t) { int s=0; for(int i=0;i<n;i++) { if(x[i]<=t) continue; s+=(int)ceil((x[i]-t)*1.0/(k-1)); if(s>t) return false; } return true; } int main() { while(scanf("%d",&n)!=EOF) { int mx=0; for(int i=0;i<n;i++) { scanf("%d",&x[i]); mx=max(mx,x[i]); } scanf("%d",&k); if(k==1) { printf("%d\n",mx); } else { int l=0; int r=0x3f3f3f3f; while(r-l>1) { int mid=(l+r)>>1; if(test(mid)) r=mid; else l=mid; } printf("%d\n",r); } } return 0; }
相关文章推荐
- yii2.0依赖注入
- MapReduce:详细介绍Shuffle的执行过程
- java.net.SocketException: No buffer space available (maximum connections reached?): JVM_Bind
- Python多线程基础学习
- 在中等企业的研发工程师
- Windows环境下EXP-00091错误的解决办法
- POJ - 1850 排列组合
- 【Property Animator 属性动画】
- 银行如何转账才能花费最少
- 常用的MySQL数据库操作语句大全
- java enum的用法总结
- 【JZOJ4647】寻找
- MapReduce数据输入中InputFormat类源码解析
- 小马哥----高仿苹果6sp(主板型号W9200_WZS_2QG 6582 7月版本刷机拆机主板图与开机识别图
- Linux下autoconf和automake使用
- 【GDOI2017模拟7.17】两棵树
- Andriod基础——Adapter类
- 今年暑假不AC
- UVA 1395 Slim Span 最小生成树
- 《数据结构》2.2顺序表(sequence list)