Submission #2205237

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
long long a, b, h[101010], l, r, s[101010],t;
bool ans, q;

bool chk(long long x){
ll u = b*x;
ll ht = a-b;
ll c=0;
for(int i =1; i<=n; i++){
    if(h[i]-u<=0)continue;
    ht = h[i]-u;
    c+=ht/(a-b);
    if(ht%(a-b)!=0)c++;
}
if(c>x)return false;
else return true;
}


int main(){
cin >> n >> a >> b;
for(int i =1 ; i<=n; i++){
    cin >> h[i];
    r = max(h[i], r);
}
l=1;
while(l<=r){
    t=(l+r)/2;
    ans = chk(t);
    q = chk(t-1);
    if(ans==true && q==false)break;
    if(ans)r=t;
    else l=t;
}

cout << t << endl;

return 0;}

Submission Info

Judge Result