zoukankan      html  css  js  c++  java
  • Drying poj3104(二分)

    Drying
    Time Limit: 2000MS   Memory Limit: 65536K
    Total Submissions: 7916   Accepted: 2006

    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 #include <iostream>
     2 #include <stdio.h>
     3 #include <string.h>
     4 #include <algorithm>
     5 int a[100001],n,k,max;
     6 bool check(int x)
     7 {
     8     int i;
     9     long long sum=0;
    10     for(i=0;i<n;i++)
    11     {
    12         if(a[i]>x)
    13         {
    14             sum+=(a[i]-x)/(k-1);
    15             if((a[i]-x)%(k-1)) sum++;
    16         }
    17     }
    18     if(sum>x)return 0;
    19     else return 1;
    20 }
    21 int fun()
    22 {
    23     int l=1,r=max;
    24     while(l<=r)
    25     {
    26         int m=(l+r)>>1;
    27         if(check(m))
    28         r=m-1;
    29         else l=m+1;
    30     }
    31     return l;
    32 }
    33 int main()
    34 {
    35     int i;
    36     scanf("%d",&n);
    37     for(i=0;i<n;i++)scanf("%d",&a[i]),max=max>a[i]?max:a[i];
    38     scanf("%d",&k);
    39     if(k==1)
    40     printf("%d
    ",max);
    41     else
    42     printf("%d
    ",fun());
    43 }
    View Code
  • 相关阅读:
    解决VS2012新建MVC4等项目时,收到加载程序集“NuGet.VisualStudio.Interop…”的错误
    BOM 清除
    sleep和Sleep区别
    出现error: stray ‘357’ in program的根源
    vi 复制或剪切多行超级强大方法
    CentOS乱码解决方法
    VBS实现文本文件按行数拆分的脚本
    python-门户应用状态检查脚本
    HTA+VBS实现的话单核查小工具
    oracle 11g 安装
  • 原文地址:https://www.cnblogs.com/ERKE/p/3588754.html
Copyright © 2011-2022 走看看