POJ 3104 Drying

原创 2016年08月28日 20:52:49

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.


【题目分析】
这题目,很容易想到贪心的方法,但是是错的(别问我,我也不知道)。然后考虑二分答案,二分之后的判定的方法很重要,我们先把他们全部减去自然风干的湿度,然后看在剩下的衣服中能否用机器在规定的时间内烘干。
注:向上取整的方法很有用


【代码】

#include <cstdio>
#include <algorithm>
#include <iostream>
using namespace std;
int a[100001];
int n,k;
inline bool test(int mid)
{
    int cnt=0;
    for (int i=1;i<=n;++i)
        if (a[i]>mid) 
        {
            cnt+=(a[i]-mid+k-2)/(k-1);
            if (cnt>mid) return false;  
        }
    return true;
}
int main()
{
    while (scanf("%d",&n)==1)
    {
        for (int i=1;i<=n;++i) scanf("%d",&a[i]);
        sort(a+1,a+n+1);
        scanf("%d",&k);
        if (k==1) {printf("%d\n",a[n]);continue;}
        int l=1,r=a[n];
        while (l<r)
        {
            int mid=(l+r)/2;
            if (test(mid))r=mid;
            else l=mid+1;
        }
        printf("%d\n",l);
    }
}
版权声明:标注来源之后可随意引用[请记得添加友链]

POJ 3104 Drying(二分逼近)

题目链接:http://poj.org/problem?id=3104 Drying Time Limit: 2000MS   Memory L...

POJ - 3104 Drying (二分搜索)

http://poj.org/problem?id=3104 题意: 有N

POJ 3104 Drying-二分答案

题意:有n件衣服需要晒干,每件有a[i]的水分,干燥有两种方式:1.自然风干,每分钟水分-1;2.用机器,每分钟只能用于一件衣服,且每件衣服水分-k。求弄干这n件衣服需要的最少的时间。 分析: 答...

POJ - 3104 Drying(二分最大化最小值)

点击打开题目链接 Drying Time Limit: 2000MS   Memory Limit: 65536K Total Submiss...

POJ 3104-Drying(二分+贪心)

C - Drying Time Limit:2000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u Submit S...

CSU-ACM2017暑假集训2-二分搜索 poj3104-drying

题目链接:drying 题目: It is very hard to wash and especially to dry clothes in winter. But Jane is a...

poj3104 Drying(二分)

It is very hard to wash and especially to dry clothes in winter. But Jane is a very smart girl. She ...

POJ 3104 Drying

题目大意: 注释代码: 无注释代码: 单词解释: dry:adj, 干的; vt, 把...弄干 radiator:n, 暖气片,辐射体 minimal:adj, 最低的,最小限度的 maximal:...

Drying POJ - 3104 求最小值,二分。

It is very hard to wash and especially to dry clothes in winter. But Jane is a very smart girl. She ...

POJ 3104 Drying (二分+精度)

题目链接:click here~~ 【题目大意】:  题意:有一些衣服,每件衣服有一定水量,有一个烘干机,每次可以烘一件衣服,每分钟可以烘掉k单位水。每件衣服没分钟可以自动蒸发掉一单位水, 用烘...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:POJ 3104 Drying
举报原因:
原因补充:

(最多只允许输入30个字)