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
代码:
//@auther yangZongJun
/********************************************//**
Date : 2015
题目来源:http://acm.hust.edu.cn/vjudge/contest/view.action?cid=74651#problem/F
题 意:
解题思路:设含水量大于 t 的第i件衣服所带的 水量 为Ai ,需要用 吹风机的 次数 为 X ,用于 风干 的时间为 Y,吹风机一分钟 能够 吹干的水量为 k,则 可得到 以下两式 : X + Y = t ; X + Y * k >= Ai ;
由以上两式可得 : Y >= (Ai - t)/(k - 1) 算出所有含水量大于 t 的衣服 的 最小的 Y , 然后相加得到 sum ,再用 sum 与 t 比较 ,作为 二分中 上下界改变的条件 。
***********************************************/
#include <cstdio>
#include <algorithm>
#include <cmath>
using namespace std;
const int MAXN = 100000+5;
int n, k;
int a[MAXN];
int main()
{
//ios::sync_with_stdio(false);
//freopen("input.txt", "r", stdin);
while(~scanf("%d", &n))
{
int maxa = -1;
for(int i = 0; i < n; i++)
{
scanf("%d", &a[i]);
maxa = max(maxa, a[i]);
}
scanf("%d", &k);
//sort(a, a+n);
if(k == 1)
{
printf("%d\n", maxa);continue;
}
int l = 0, r = maxa;
int ans;
while(r - l >= 1)
{
int mid = (r+l)/2;
long long sum = 0, temp = 0;
for(int i = 0; i < n; i++)
{
if(a[i] > mid)
{
temp = ceil((a[i]-mid)*1.0 / (k-1));
sum += temp;
}
}
if(sum > mid)
{
l = mid + 1;
}
else
{
r = mid;
}
ans = (l+r)/2;
}
printf("%d\n",ans);
}
return 0;
}