烘衣服（二分）

最新推荐文章于 2021-10-01 21:42:47 发布

Fool xa

最新推荐文章于 2021-10-01 21:42:47 发布

阅读量138

点赞数

分类专栏：关于算法学习

本文链接：https://blog.csdn.net/Conqueror_demons/article/details/118094881

版权

关于算法学习专栏收录该内容

19 篇文章 0 订阅

订阅专栏

这是一个关于衣物烘干效率优化的问题。文章描述了如何通过编程解决在冬季快速烘干衣物的策略。给定每件衣物的初始含水量和烘干器每分钟的烘干能力，目标是最小化总的烘干时间。解题思路涉及二分查找，寻找最小可能的烘干总时间，确保所有衣物都能在该时间内被烘干。文章提供了样例输入和输出，并展示了具体的代码实现。

摘要由CSDN通过智能技术生成

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

题意：有n个洗完的衣服，每个含有a[i]的水，自然晾干每分钟凉1水量，只有一个干燥器，一次只能干燥一件衣服，每分钟可干燥k水量，问最小化的干燥时间（所有衣服）；
解题思路:
二分所需要干燥的时间mid，如果我们用这么多时间晾干衣服，那么衣服中水的含水量低等于mid的可以自动晾干，只需要处理大于mid的衣服，对这些衣服，如果花时间t用来干燥，那么就有(mid-t)的时间自动晾干，所以对当前的a[i]>=t*k+(mid-t)，所以尽可能小的时间就是t=(a[i]-mid)/(k-1)遍历每个a[i]，记录时间t，如果t大于当前mid，说明该mid时间不够，反之mid偏大；

#include <math.h>
#include <stdio.h>
#include <algorithm>
using namespace std;
long long a[100005];
long long n,k;
long long judge(long long t)
{           
    long long i,sum;                    
    sum=0;                     
    for(i=0;i<n;i++) //k*x+(t-x)>=a[i],推出x>=(a[i]-t)/(k-1)
    if(a[i]>t)
    sum+=(long long)(ceil((a[i]-t)*1.0/(k-1)));//ceil向上取整 
    return sum;
}
int main(){
    long long i,l,r,ans,mid;
    while(~scanf("%lld",&n))
	{
        l=r=ans=0;
        for(i=0;i<n;i++)
	        scanf("%lld",&a[i]);
        scanf("%lld",&k);
        sort(a,a+n);
        r=a[n-1];
        if(k==1)
		{                    
            printf("%lld\n",r);       
            continue;
        }
        while(l<=r)
		{                    
            mid=(l+r)/2;
            if(judge(mid)<=mid)//说明在mid时间内烘干机有空闲时间还能继续使用，时间还能更短
			{
                ans=mid;
                r=mid-1;
            }
            else//说明mid时间内烘不干，需要更长的时间
            l=mid+1;
        }
        printf("%lld\n",ans);
    }
    return 0;
}