zoukankan      html  css  js  c++  java
  • POJ3104(二分搜索)

    Drying
    Time Limit: 2000MS   Memory Limit: 65536K
    Total Submissions: 13057   Accepted: 3358

    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 kwater, 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
    思路:二分minute。设每个clothes所需y次烘干,那么就有minute-y次自然干。minute-y+y*k>=x[i]。解y>=(x[i]-minute)/(k-1)。注意k等于1的情况。
    #include <cstdio>
    #include <algorithm>
    #include <math.h>
    using namespace std;
    const int MAXN=100005;
    int n,k;
    int x[MAXN];
    bool test(int t)
    {
        int s=0;
        for(int i=0;i<n;i++)
        {
            if(x[i]<=t)    continue;
            s+=(int)ceil((x[i]-t)*1.0/(k-1));
            if(s>t)    return false;
        }
        return true;
    }
    int main()
    {
        while(scanf("%d",&n)!=EOF)
        {
            int mx=0;
            for(int i=0;i<n;i++)        
            {
                scanf("%d",&x[i]);
                mx=max(mx,x[i]);
            }
            scanf("%d",&k);
            if(k==1)
            {
                printf("%d
    ",mx);
            }
            else
            {
                int l=0;
                int r=0x3f3f3f3f;
                while(r-l>1)
                {
                    int mid=(l+r)>>1;
                    if(test(mid))    r=mid;
                    else l=mid;
                }
                printf("%d
    ",r);
            }
        }
        return 0;
    }
  • 相关阅读:
    unity3d进程通信利用WM_COPYDATE和HOOK
    java解析XML saxReader.read(xml) 错误:org.dom4j.DocumentException: no protocol
    Linux下永久改动MAC地址和ifconfig命令总结
    Android-Universal-Image-Loader学习笔记(3)--内存缓存
    图片3d轮放查看效果
    Hadoop-eclipse-plugin插件安装
    Hadoop格式化HDFS报错java.net.UnknownHostException: localhost.localdomain: localhost.localdomain
    linux出现bash: ./java: cannot execute binary file 问题的解决办法
    分析windows宿主机Ping不通linux虚拟机的其中一种情况
    http://jingyan.baidu.com/article/08b6a591f0fafc14a9092275.html
  • 原文地址:https://www.cnblogs.com/program-ccc/p/5678853.html
Copyright © 2011-2022 走看看