link

大悲 成功 rk 1000 掉一下

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define INF 0x3f3f3f3f
#define MAXN 10000001
int t[MAXN];
 main()
{
    //freopen("task4.in","r",stdin);
    double r;
    int n,x,p,q;
    cin>>n>>x>>p>>q;
    //cout<<n<<endl;
    //cout<<n<<endl;
    r=p/(q+0.0);
    for(int i=1;i<=n;i++) cin>>t[i];
    int day=1,slp=0;
    for(int i=1;i<=n;day++)//r*x*i
    {
        //cout<<i<<" "<<r*x*i<<"<="<<slp+(x-t[i])<<"\n";
        int last=i,tot=0;
        while(r*x*day<=slp+(x-t[i])&&i<=n&&tot+t[i]<=x)
        {
            //cout<<i<<" "<<r*x*day<<"<="<<slp+(x-t[i])<<"\n";
            tot+=t[i];
            i++;
        }
        if(i==last) slp+=x;
        else last+=(x-tot);
        /*if(r*x*i>slp+(x-t[i])) { slp+=x; i--; }
        else
        {

        }*/
    }
    cout<<day;
    return 0;
}