[二分-最小化最大值] - poj3104-Drying

Drying
Time Limit: 2000MS Memory Limit: 65536K
Total Submissions: 20853 Accepted: 5246

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

题意:

每件衣服都有一定单位水分,在不适用烘干器的情况下,每件衣服每分钟自然流失1个单位水分,

但如果使用了烘干机则每分钟流失K个单位水分,但是遗憾是只有1台烘干机,

每台烘干机同时只能烘干1件衣服,请问要想烘干N件衣服最少需要多长时间?

题解:

二分枚举时间,对与当前时间mid,遍历每一个ai,如果ai > mid 就代表需要用吹风机了,

而用吹风机每分钟扣k点水!注意:吹风机的效果不与自然流失的同时生效.

换句话说,吹风机的效果为k - 1

需要特判的是,当k=1时,吹风机的效果等同与自然流失,于是答案就是max(ai);

对于二分的两个边界来说,left 为 0,right为max(ai) (表示不需要用吹风机最多用的时间)

代码:

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long ll;
const int maxn = 1e5+10;
ll arr[maxn],n,k,sum;
bool check(ll mid) {
    ll temp,cnt;
    for(int i=0,j=mid;i<n;i++) {
        temp = arr[i] - mid;
        if(temp > 0) {
            if(j) {
                cnt = temp / k;
                if(temp % k) cnt++;
                if(j >= cnt) j-=cnt;
                else return false;
            }
            else return false;
        }
    }
    return true;
}
int main()
{
    while(~scanf("%lld",&n)){
        ll left = 0,right = 0,sum = 0;
        for(int i=0;i<n;i++) scanf("%lld",&arr[i]), right = max(arr[i],right);
        scanf("%lld",&k);k--;
        if(k == 0){
            printf("%lld\n",right);
            continue;
        }
        while(left <= right) {
            ll mid = (left + right) >> 1;
            if(check(mid)) right = mid - 1;
            else left = mid + 1;
        }
        printf("%lld\n",left);
    }
    return 0;
}

阅读更多
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/m0_38013346/article/details/79981110
个人分类: 二分
上一篇[二分-最小化最大值] - poj3273-Monthly Expense
下一篇LightOJ-1027- A Dangerous Maze-直接递推期望
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

关闭
关闭
关闭