POJ 3104 Drying (二分+精度)

题目链接:click here~~

【题目大意】:

题意:有一些衣服,每件衣服有一定水量,有一个烘干机,每次能够烘一件衣服,每分钟能够烘掉k单位水。

每件衣服没分钟能够自己主动蒸发掉一单位水,

用烘干机烘衣服时不蒸发。问最少须要多少时间能烘干全部的衣服。

【解题思路】:

题目数据较大。常规方法肯定会TE。首先能够想到二分枚举答案。枚举时间mid值,(一般二分的题目,题目叫你求什么,就二分什么就能够了)

那么相应两种方法

1:自然风干。2:吹风机吹干

若一件衣服的水量小于mid,则自然风干就可以,否则。如果吹风机花费时间X。用于风干的时间为Y。吹风机一分钟可以吹干的水量为k,

则可得到下面两式 :

X+Y=mid。

X+Y*k>=ai  ;

由以上两式可得Y>=(ai-mid)/(k -1)(关键啊。)

算出全部含水量大于mid的衣服的最小的Y(事实上就是把Y相加)得到sum ,最后sum与mid比較,return y<=mid就可以。

代码:

#include <stdio.h>
#include <string.h>
#include <math.h>
#include <iostream>
#include <algorithm>
using namespace std;
const int N=1e5+10;
int a[N];
int n,m,k;
bool get(int mid)
{
    int y=0;
    for(int i=0; i<n; i++){
        if(a[i]<=mid) continue;
        else{
            y+=ceil((double)(a[i]-mid)/(k-1));//一定要注意精度啊,不加ceil((double))会WA啊。
        }
        if(y>mid) return false;
    }
    return y<=mid;
}
int main()
{
   // freopen("1.txt","r",stdin);
    scanf("%d",&n);
    int maxx=0;
    for(int i=0; i<n; ++i){
        scanf("%d",&a[i]);
        maxx=max(maxx,a[i]);
    }
    //cout<<"maxx=="<<maxx<<endl;
    scanf("%d",&k);
    if(k==1)printf("%d\n",maxx);
    else{
        int ll=0,rr=maxx;
        for(int i=1; i<=100; i++){
            int mid=(ll+rr)/2;
            if(get(mid))rr=mid;
            else ll=mid;
        }
            printf("%d\n",ll+1);
    }
    return 0;
}
时间: 2024-10-07 10:18:39

POJ 3104 Drying (二分+精度)的相关文章

poj 3104 Drying (二分)

/*设某次二分出的一个值是mid: 1.对于一件ai值小于等于mid的衣服,直接晾干即可: 2.对于一件ai值大于mid值的衣服,最少的用时是用机器一段时间, 晾干一段时间,设这两段时间分别是x1和x2, 那么有mid=x1+x2,ai<=k*x1+x2,解得x1>=(ai-mid)/(k-1) , 所以对(ai-mid)/(k-1)向上取整就是该件衣服的最少用时.*/ # include <stdio.h> # include <string.h> # include

POJ 3104 Drying(二分答案)

题目链接:http://poj.org/problem?id=3104 Drying Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 11128   Accepted: 2865 Description It is very hard to wash and especially to dry clothes in winter. But Jane is a very smart girl. She is not afra

POJ 3104 Drying [二分 有坑点 好题]

传送门 表示又是神题一道 Drying Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 9327   Accepted: 2364 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 proces

POJ - 3104 Drying 二分 + 贪心

题目大意:有n件湿的衣服,每件衣服都有相应的湿度,每分钟每件衣服的湿度减1(除了在烘干机里的衣服),现在有一个烘干机,烘干机一分钟可以让一件衣服的湿度降低k,问至少要花多少分钟才能使每件衣服的湿度为0 解题思路:贪心的话,每分钟都要使用到烘干机. 枚举时间,如果湿度小于等于时间的话,就不用考虑了,在枚举时间内肯定会干的 如果湿度大于枚举时间的话,就要考虑一下了,该衣服要在给定时间内湿度变为零的话就要满足该式子,设已经过了cnt分钟了,当前这件衣服的湿度为num[i],枚举的时间为mid,那么 (

POJ 3104 Drying(二分)

题目描述: Drying Time Limit: 2000MS Memory Limit: 65536K 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. B

POJ 3104 Drying(二分

Drying Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 22163   Accepted: 5611 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

POJ 3104 Drying

Drying Time Limit: 2000ms Memory Limit: 65536KB This problem will be judged on PKU. Original ID: 310464-bit integer IO format: %lld      Java class name: Main It is very hard to wash and especially to dry clothes in winter. But Jane is a very smart g

poj 3104 Drying(二分搜索之最大化最小值)

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

poj 1064 Cable master ,二分 精度!!!

给出n根绳子,求把它们切割成K条等长的绳子的最大长度是多少? 二分 用 for(int i=0; i<100; ++i) 代替   while(r-l>eps) 循环100次精度能达到1e-30,基本上能一般题目的精度要求. 而 浮点数二分区间的话容易产生精度缺失导致死循环. #include<cstdio> double L[10000 + 10]; int n, k; int ok(double x) { int cnt = 0; for(int i=0; i<n; ++