Submission #1778750

---

Source Code Expand

#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<set>
#include<vector>
#include<map>
#define N 100100
#define abs(x) return x>0?x:(-x)
#define sqr(x) return x*x
typedef long long ll;
using namespace std;
// coding........
ll w[N];
int n;
ll a,b;
bool Check(ll x)
{
    ll num=0;
    for (int i=0;i<n;i++)
    {
        ll ans=w[i]-x*b;
        if (ans>0)
        {
            num+=(ans/(a-b));
            if (ans%(a-b))
                num++;
            if (num>x||num<0)
                return false;
        }
    }
    return true;
}
int main()
{
    scanf("%d%lld%lld",&n,&a,&b);
    ll maxn=0;
    for (int i=0;i<n;i++)
      {
           scanf("%lld",&w[i]);
           maxn=max(maxn,w[i]);
      }
    ll l=0,r=maxn;
    while (l<r)
    {
        ll mid=(l+r)/2;
        if (Check(mid))
            r=mid;
        else
            l=mid+1;
    }
    printf("%lld\n",r);
    return 0;
}

Submission Info

Judge Result