Submission #1778804

---

Source Code Expand

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<iomanip>
#include<algorithm>
using namespace std;
#define M 1e-9
#define N 100005
typedef long long ll;
ll  w[N];
ll  v[N];
ll  n,a,b;
ll INF=10000000000;
bool C(ll  x){
    ll t=x;
    ll y;
    for(ll i=0;i<n;i++)
       v[i]=w[i];
    for(ll i=0;i<n;i++){
        v[i]-=x*b;
        if(v[i]>0)
      {
          if(v[i]%(a-b)==0)
              y=v[i]/(a-b);
          else
              y=v[i]/(a-b)+1;
          t-=y;
      }
    }
   if(t>=0) return true;
    return false;
}

int main()
{
   scanf("%d%d%d",&n,&a,&b);
   for(int i=0;i<n;i++)
     scanf("%d",&w[i]);
    ll  lb=0,ub=INF;
   while(ub-lb>1){
        ll mid=(lb+ub)/2;
        if(C(mid))
           ub=mid;
        else
           lb=mid;
    }
    cout<<ub<<endl;
   return 0;
}

Submission Info

Judge Result