POJ 3104 Drying
来源:互联网 发布:ubuntu 笔记本 编辑:程序博客网 时间:2024/06/07 23:33
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.
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 a single integer — the minimal possible number of minutes required to dry all clothes.
sample input #132 3 95sample input #232 3 65
sample output #13sample output #22
二分,相当于每秒所有的衣服都烘干1,烘干机烘干k-1
AC代码:
#include<iostream>#include<algorithm>#include<cstring>#include<stdio.h>#include<cmath>using namespace std;int n;long long a[100005];long long k;int check(long long m){ long long x = 0; for(int i = 0; i <n; i++) { if(a[i] > m) { x += (a[i] - m) / (k - 1); if((a[i] - m) % (k - 1) != 0) x++; } if(x > m) return 0; } return 1;}int main(){ while(scanf("%lld", &n) != EOF) { long long ans = 0; long long max_ = -1; for(int i = 0; i < n; i++) { scanf("%lld", &a[i]); if(max_ < a[i]) max_ = a[i]; } scanf("%lld", &k); if(k == 1) ans = max_; else { long long left = 1, right = max_, mid; while(left <= right) { mid = (left + right) >> 1; if(check(mid) == 1) { ans = mid; right = mid - 1; } else left = mid + 1; } } printf("%lld\n", ans); } 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
- 单片机的定时器中断的学习(一)
- 冒泡排序
- Spring
- GreenPlum之按月份或季度实现行转列
- test命令的文件比较功能
- POJ 3104 Drying
- spring定时任务的配置及注释
- 5并行数据加载
- 二级指针输入模型(三种内存模型)
- POJ 1655 Balancing Act
- eclipse中使用git
- Java操作Excel基本
- 交换排序(2)--快速排序3种实现方案及其优化
- C++引用/枚举/typedef/头文件/预编译器/自定义头文件