zoukankan      html  css  js  c++  java
  • Drying POJ

    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 aiseparated 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

    这题水题二分(不过要注意的点非常多,非常容易WA)
    (a[i]-x+k-2)/(k-1)这个是一个向上取整
    二分答案,将时间进行二分
     1 #include<cstdio>
     2 #include<cstring>
     3 #include<cmath>
     4 #include<algorithm>
     5 #include<queue>
     6 using namespace std;
     7 long long a[100010],n,k;
     8 int check(long long x)
     9 {
    10     long long time=0;
    11     if (k==1) return 1;
    12     for (int i=0 ;i<n ;i++ ){
    13         if (a[i]>x) time+=(a[i]-x+k-2)/(k-1);
    14     }
    15     if (time>x) return 1;
    16     return 0;
    17 }
    18 int main() {
    19     long long maxn;
    20     while(scanf("%lld",&n)!=EOF){
    21         maxn=0;
    22         for (int i=0 ;i<n ;i++ ){
    23             scanf("%lld",&a[i]);
    24             maxn=max(maxn,a[i]);
    25         }
    26         scanf("%lld",&k);
    27         long long l=0,r=maxn,mid;
    28         while(r-l>1){
    29             mid=(l+r)/2;
    30             if (check(mid)) l=mid;
    31             else r=mid;
    32         }
    33         printf("%lld
    ",r);
    34     }
    35     return 0;
    36 }
  • 相关阅读:
    在主窗体中打开一个新子窗体,如果已有子窗体,则激活它,而不打开新的。
    文本的追加
    男人至少的品质底线
    做人,做事,生活,学习,爱情>人生
    日常中一些好用的小软件
    ◆2008 年广告创意设计师必备网址汇总◆
    在SharePoint中更改当前登录用户的密码
    SONY笔记本VGNSZ65装VISTA记
    Outlook收邮件速度超慢的原因
    Cisco路由器做限速
  • 原文地址:https://www.cnblogs.com/qldabiaoge/p/8515685.html
Copyright © 2011-2022 走看看