zoukankan      html  css  js  c++  java
  • POJ 3104 Drying

    Drying

    Time Limit: 2000MS Memory Limit: 65536K
    Total Submissions: 25853 Accepted: 6484

    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

    Source

    Northeastern Europe 2005, Northern Subregion
    坑:除数为零会RE,有个函数叫ceil ,在省赛用ceil wa了2次,建议取整还是自己写。

    #include<cstdio>
    #include<iostream>
    #include<cmath>
    #include<cstring>
    long long  n,k;
    int a[1001000];
    bool dix(long long x)
    {
    	long long i,time=0;
    	if(k==1)
    		return true;
    	for(i=0;i<n;++i)
    	{
    		if(a[i]>x)
    			time+=(a[i]-x+k-2)/(k-1);
    	}
    	if(time>x)
    		return true;
    	return false;
    }
     
    int main()
    {
    	long long max;
    	long long i;
    	while(scanf("%lld",&n)!=EOF)
    	{
    		max=0;
    		for(i=0;i<n;++i)
    		{
    			scanf("%lld",&a[i]);
    			if(max<a[i])
    				max=a[i];
    		}
    		scanf("%lld",&k);
    		long long left=0,right=max,mid;
    		while(left<right-1)
    		{
    			mid=(left+right)/2;
    			if(dix(mid))
    				left=mid;
    			else 
    				right=mid;	
    		}
    		printf("%lld
    ",right);
    	}
    	return 0;
    }
    
    
  • 相关阅读:
    BZOJ4269: 再见Xor(线性基)
    Codeforces Round #473 (Div. 2)
    洛谷P3812 【模板】线性基
    CodeChef March Lunchtime 2018 div2
    BZOJ1023: [SHOI2008]cactus仙人掌图(仙人掌dp)
    【Android】Android布局中实现圆角边框
    Java学习系列(一)Java的运行机制、JDK的安装配置及常用命令详解
    mac OSX上eclipse adb无法识别(调试)小米的解决方案
    IOS回调机制——代理,通知中心以及Block
    长沙国储电脑城-学生买电脑-被坑记
  • 原文地址:https://www.cnblogs.com/lunatic-talent/p/12798934.html
Copyright © 2011-2022 走看看