# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
914714 | DucNguyen2007 | Rice Hub (IOI11_ricehub) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int maxN=1e5+5;
ll sum[maxN+1];
ll get(ll l,ll r)
{
if(l==0)
{
return sum[r];
}
else return sum[r]-sum[l-1];
}
ll besthub(ll L,ll n,ll a[],ll B)
{
sum[0]=a[0];
for(int i=1;i<n;i++)
{
sum[i]=sum[i-1]+a[i];
}
for(int len=1;len<=n;len++)
{
ll l=0,r=len-1;
while(r<n)
{
ll p=(l+r)/2;
ll cur=(p-l+1)*a[p]-get(l,p)+get(p,r)-(r-p+1)*a[p];
if(cur<=B)
{
return len;
}
}
}
}