POJ 3104 Drying（二分+计数）

最新推荐文章于 2021-02-24 14:27:42 发布

coderyzh

最新推荐文章于 2021-02-24 14:27:42 发布

阅读量142

点赞数

分类专栏：数学基础 ACM

本文链接：https://blog.csdn.net/ytuyzh/article/details/83959929

版权

ACM 同时被 2 个专栏收录

31 篇文章 0 订阅

订阅专栏

数学基础

13 篇文章 0 订阅

订阅专栏

题目传送门

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代表的是n件衣服，接下来输入的n个数代表的是没一件衣服所带的含水量，最后一个k代表的是吹风机每分钟能够烘干的水量，自然风干每分钟风干1单位的水。问最少需要几分钟才能将所有衣服烘干。

题解：

对时间进行二分，如果可以在t时间风干，那就继续找更小的，否则找更大的。
难点就在于怎么判断是否可以在t时间内风干。
首先对于Ai小于t的衣服，可以直接自然风干，不需要吹风机，所以不用考虑。

我们假设第i件衣服需要 X 分钟吹风机的时间，Y分钟自然风干的时间，已知总时间 t ，衣服的水量Ai , 吹风机每分钟减少k单位水，自然风干每分钟减少1单位水。有：

X + Y = t
X * k + Y >= Ai

由这两个式子可得：X>=(Ai-t)/(k-1)。
有了这个式子就可以计算出所有衣服需要使用吹风机的最小时间，把这些时间相加，如果这个时间小于t就说明可以在t时间内吹干所有衣服。

附上大牛详解https://blog.csdn.net/xp731574722/article/details/76098499

#include<iostream>
#include<algorithm>
#include<cstdio>
using namespace std;
#define ll long long
ll maxn;
ll n,k;
ll inf=100007;
ll a[100007];
bool solve(ll t)
{
    ll ans=0;
    for(ll i=1;i<=n;i++)
    {
        if(a[i]>t)
        {
            ans+=(a[i]-t)/(k-1);//每件衣服使用吹风机的时间
            if((a[i]-t)%(k-1))
                ans++;
        }
    }
    if(ans<=t)//如果时间小于t
        return true;
    return false;
}
void search_quick()
{
    ll ans=0;
    ll l=1,r=maxn;//mid表示所有衣服晒干的总时间，二分遍历寻找最短时间
    while(l<=r)
    {
        ll mid=(l+r)/2;
        if(solve(mid))
        {
            ans=mid;
            r=mid-1;
        }
        else
        {
            l=mid+1;
        }
    }
    printf("%lld\n",ans);
}
int main()
{
    while(~scanf("%lld",&n))
    {
        for(ll i=1;i<=n;i++)
        {
            scanf("%lld",&a[i]);
            maxn=max(maxn,a[i]);
        }
        scanf("%lld",&k);
        if(k==1)//吹风机时间为1，和风干时间一样，所以直接输出最大值就ok了
        {
            printf("%lld\n",maxn);
        }
        else
        {
           search_quick();
        }
    }
    return 0;
}