# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
170437 | nafis_shifat | Rice Hub (IOI11_ricehub) | C++14 | 29 ms | 3448 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 "ricehub.h"
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int mxn=1e5+5;
const ll inf=2e15+5;
ll ar[mxn];
int besthub(int R, int L, int X[], long long B)
{
ll tot[mxn];
tot[0]=0;
for(int i=1;i<=R;i++)
{
ar[i]=X[i-1];
tot[i]=tot[i-1]+ar[i];
}
int ans=0;
for(int i=1;i<=R;i++)
{
int lo=i;
int hi=R;
while(lo<=hi)
{
int mid=lo+hi>>1;
int k=i+mid>>1;
ll ts=(ar[k]*(k-i+1))-(tot[k]-tot[i-1]);
ts+=(tot[mid]-tot[k])-ar[k]*(mid-k);
if(ts<=B)
{
ans=max(ans,mid-i+1);
lo=mid+1;
}
else
{
hi=mid-1;
}
}
}
return ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |