POJ3104 Drying(二分查找)

Posted 2020-07-02 xgboost

POJ3104 Drying

/*
* Created:     2016年03月31日 22时25分12秒 星期四
* Author:      Akrusher
*
*/
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <deque>
#include <list>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <numeric>
#include <iomanip>
#include <bitset>
#include <sstream>
#include <fstream>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define in(n) scanf("%d",&(n))
#define in2(x1,x2) scanf("%d%d",&(x1),&(x2))
#define inll(n) scanf("%I64d",&(n))
#define inll2(x1,x2) scanf("%I64d%I64d",&(x1),&(x2))
#define inlld(n) scanf("%lld",&(n))
#define inlld2(x1,x2) scanf("%lld%lld",&(x1),&(x2))
#define inf(n) scanf("%f",&(n))
#define inf2(x1,x2) scanf("%f%f",&(x1),&(x2))
#define inlf(n) scanf("%lf",&(n))
#define inlf2(x1,x2) scanf("%lf%lf",&(x1),&(x2))
#define inc(str) scanf("%c",&(str))
#define ins(str) scanf("%s",(str))
#define out(x) printf("%d\n",(x))
#define out2(x1,x2) printf("%d %d\n",(x1),(x2))
#define outf(x) printf("%f\n",(x))
#define outlf(x) printf("%lf\n",(x))
#define outlf2(x1,x2) printf("%lf %lf\n",(x1),(x2));
#define outll(x) printf("%I64d\n",(x))
#define outlld(x) printf("%lld\n",(x))
#define outc(str) printf("%c\n",(str))
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
#define mem(X,Y) memset(X,Y,sizeof(X));
typedef vector<int> vec;
typedef long long ll;
typedef pair<int,int> P;
const int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
const int INF=0x3f3f3f3f;
const ll mod=1e9+7;
ll powmod(ll a,ll b) {ll res=1;a%=mod;for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
const bool AC=true;

int n,k,maxn;
int a[100005];
bool C(int x){ //考虑外面每分钟减少1,放入烘干机其实每分钟减少k-1
    int num=x; //剩余的烘干时间,
    bool flag=true;
    rep(i,0,n){
        if(a[i]>x){
        if(k==1){ //不判断可能会re
        flag=false;break;
    }
    num=num-(a[i]-x+k-2)/(k-1);
    if(num<0){
    flag=false;break;}
    }
    }
 return flag;
}    
int main()
{
    while(in(n)!=EOF){
    maxn=0;
     rep(i,0,n){
         in(a[i]);
         maxn=max(maxn,a[i]);
         }
     in(k);
     int lb,ub,mid;
     lb=0,ub=maxn;
     while(ub>lb){
     mid=(ub+lb)/2;
     if(C(mid)) ub=mid;
     else lb=mid+1;
     }
    out(ub);
    }
    return 0;
}