AtCoder Regular Contest 075 D Widespread

题目传送门

这道题其实二分一下答案就okay了的 不过LL什么的有时候忘了加 被卡了下

#include<cstdio>
#include<cstring>
#include<algorithm>
#define LL long long
using namespace std;
const int M=;
int read(){
    int ans=,f=,c=getchar();
    while(c<''||c>''){if(c=='-') f=-; c=getchar();}
    while(c>=''&&c<=''){ans=ans*+(c-''); c=getchar();}
    return ans*f;
}
int n,p,q,w;
int s[M];
LL ans;
bool check(LL x){
    LL now=x*q,tot=;
    int top=n,v;
    while(top){
        if(s[top]<=now) break;
        if((s[top]-now)%w) v=(s[top]-now)/w+;
        else v=(s[top]-now)/w;
        tot+=v;
        top--;
    }
    return tot<=x;
}
int main()
{
    n=read(); p=read(); q=read(); w=p-q;
    for(int i=;i<=n;i++) s[i]=read();
    sort(s+,s++n);
    LL l=,r=1e9;
    while(l<=r){
        LL mid=(l+r)>>;
        if(check(mid)) ans=mid,r=mid-;
        else l=mid+;
    }
    printf("%lld\n",ans);
    return ;
}