POJ 3104 Drying

原创 2016年08月29日 17:36:44

http://poj.org/problem?id=3104

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

题目大意:
晾衣服:n件衣服各含a[i]水分,自然干一分钟一单位,放烘干机一分钟k单位,一次只能晒一件。求最短时间。
题目思路:
二分最短时间。

注意:
1.每分钟烘干k单位的水,于是当然地除k向上取整了((a[i] – mid) / k)。其实应该除以k-1,列个详细的算式:
设需要用x分钟的机器,那么自然风干需要mid – x分钟,x和mid需要满足:
k*x + (mid – x) >= a[i],即 x >= (a[i] – mid) / (k – 1)。
2.当k=1的时候,很显然会发生除零错误,需要特判。
3.需要完全干,所以时间需要向上取整,即为(a[i]-mid+k-2)/(k-1)。

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<math.h>
#define N 100005
using namespace std;

int a[N];
int main()
{
    int n;
    while(scanf("%d",&n)!=EOF)
    {
        int k,i,j;

        for(i=0;i<n;i++)
            scanf("%d",&a[i]);
        sort(a,a+n);
        scanf("%d",&k);
        if(k==1)
            printf("%d\n",a[n-1]);
        else
      {
        int left=1,right=a[n-1],mid;

        while(left<right)
        {
            long long sum=0;
            mid=(left+right)/2;

            for(i=0;i<n;i++)
                {
                    if(a[i]>mid)
                    sum+=(a[i]-mid+k-2)/(k-1);

                }
            if(sum>mid)
                left=mid+1;
            else
                right=mid;
         }
        printf("%d\n",left);

      }
    }
    return 0;
}

马上要开学了……
这里写图片描述
可是不开学就没法放假,没法放假就不能回家找妈妈,啊啊啊,快放寒假吧,妈妈啊……

版权声明:本文为博主原创文章,未经博主允许不得转载。

POJ 3104 Drying (二分+精度)

题目链接:click here~~ 【题目大意】:  题意:有一些衣服,每件衣服有一定水量,有一个烘干机,每次可以烘一件衣服,每分钟可以烘掉k单位水。每件衣服没分钟可以自动蒸发掉一单位水, 用烘...
  • u013050857
  • u013050857
  • 2015年06月04日 10:10
  • 805

POJ-3104-Drying

这个题同样是二分,不过有个技巧就在于二分的时间把
  • z309241990
  • z309241990
  • 2014年08月12日 09:51
  • 1076

poj 3104 Drying(二分)

Drying Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 13600   Accepted: 3499 ...
  • CillyB
  • CillyB
  • 2016年08月15日 15:49
  • 161

Poj 3104 Drying

Description It is very hard to wash and especially to dry clothes in winter. But Jane is a very sma...
  • fzw_captain
  • fzw_captain
  • 2015年06月22日 23:49
  • 165

POJ 3104 Drying (二分)

Drying Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 9440   Acc...
  • qq_34374664
  • qq_34374664
  • 2017年03月09日 14:11
  • 383

POJ 3104 Drying 笔记

描述 这是很难洗,特别是在冬天干衣服。但简是一个非常聪明的女孩。她不怕这个无聊的过程。简已决定使用散热器使干燥更快。但是散热器很小,所以它一次只能容纳一件东西。...
  • woniupengpeng
  • woniupengpeng
  • 2016年12月15日 20:20
  • 81

POJ 3104 Drying(二分)

二分
  • lihongyang123
  • lihongyang123
  • 2016年05月06日 09:50
  • 436

poj 3104 Drying

题目来源:POJ 3104 题目分析: 给你n件衣服,每件衣服有ai含水量,现有两种方式使他们变干: 1、自然蒸发,每分钟蒸发1滴水 2、烘干机烘干,每分钟蒸发k滴水(此时衣服不再自然蒸发) ...
  • polanwind
  • polanwind
  • 2017年07月06日 20:22
  • 66

POJ 3104 Drying

C - Drying Time Limit:2000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u Submit S...
  • u013497977
  • u013497977
  • 2015年07月20日 23:50
  • 551

POJ 3104 Drying ——二分

#include #include #include #include using namespace std; const int maxn = 100000 + 10; int n,...
  • hao_zong_yin
  • hao_zong_yin
  • 2017年05月26日 23:03
  • 87
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:POJ 3104 Drying
举报原因:
原因补充:

(最多只允许输入30个字)