POJ 3104

原创 2016年10月23日 14:57:38

Time Limit: 2000MS   Memory Limit: 65536KB   64bit IO Format: %lld & %llu

 Status

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. 验证答案时,如果 a[i] <= mid,让它自然烘干即可 ;

 如果a[i] > mid,那么烘干这件衣服可以分成两段时间:(注意要使时间最短)使用烘干机时间x1 + 自然烘干时间x2,

那么可以列出等式:mid = x1 + x2;

 a[i] <= kx1+x2;于是得x1 >= (a[i] -mid)/(k-1);即得使用烘干机的最少时间x1

#include <iostream>#include <cstdio>#include <cstring>#include <cmath>#include <algorithm>using namespace std;const int N = 100010;long long a[N];int judge(long long x);int n;long long k;int main(){    while(scanf("%d", &n)!=EOF)    {        long long  l=1, r=0;        for(int i=1;i<=n;i++)        {            scanf("%lld", &a[i]);            r=max(r,a[i]);        }        scanf("%lld", &k);        if(k==1)        {            printf("%lld\n",r);            continue;        }        while(l<=r)        {            long long mid=(l+r)/2;            if(judge(mid))            {                r=mid-1;            }            else            {                l=mid+1;            }        }        printf("%lld\n",l);    }    return 0;}int judge(long long x){    long long cnt=0;    for(int i=1;i<=n;i++)    {        if(a[i]>x)        {            cnt=cnt+ceil((a[i]-x)*1.0/(k-1));        }    }    if(cnt<=x)    {        return 1;    }    return 0;}

Time Limit: 2000MS   Memory Limit: 65536KB   64bit IO Format: %lld & %llu

 Status

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
版权声明:本文为博主原创文章,未经博主允许不得转载。

poj 3104代码

  • 2014年07月13日 18:22
  • 1000B
  • 下载

POJ3104(二分法)

看到这货后,区间dp浮现于我的脑海 沉思片刻,发现 这货根本就不是区间dp! 至于为什么要使用二分? 这还得考虑考虑二分的原理。 当我萌第一次接触二分的时候,普遍会认为二分法只是用来查找一个单调的...

POJ 3104 Drying(二分逼近)

题目链接:http://poj.org/problem?id=3104 Drying Time Limit: 2000MS   Memory L...

POJ - 3104 Drying (二分搜索)

http://poj.org/problem?id=3104 题意: 有N

POJ 3104 Drying-二分答案

题意:有n件衣服需要晒干,每件有a[i]的水分,干燥有两种方式:1.自然风干,每分钟水分-1;2.用机器,每分钟只能用于一件衣服,且每件衣服水分-k。求弄干这n件衣服需要的最少的时间。 分析: 答...

poj 3104

题意易懂。 如果枚举的话,肯定会超时。所以我们用二分来得出最小的时间。假设此时我们最小时间为mid,那么对于衣服的含水量a[i]mid的来说,最好的方案就是先用吹风机吹,再自然风干。我们设用吹风机吹...
  • leohujx
  • leohujx
  • 2015年10月06日 11:16
  • 178

POJ - 3104 Drying(二分最大化最小值)

点击打开题目链接 Drying Time Limit: 2000MS   Memory Limit: 65536K Total Submiss...

poj3104(二分判断可行性)

/* translation: 要使得一排衣服晾干,自然风干每分钟蒸发1单位的水分。用烘干机的话每分钟蒸发k单位的水分。求把所有衣物晾干的话至少需要多长时间? solution: 二分查找最小可行...

二分法--案列(烘干衣服 poj3104)

Drying Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 18921   Accepted: 4742 ...

POJ 3104-Drying(二分+贪心)

C - Drying Time Limit:2000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u Submit S...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:POJ 3104
举报原因:
原因补充:

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