# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
133015 | tinjyu | 쌀 창고 (IOI11_ricehub) | C++14 | 18 ms | 1528 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 <iostream>
using namespace std;
long long int sum[100005],a[100005][2];
int besthub(int R, int L, int X[], long long B)
{
long long int now=0;
for(int i=0;i<R;i++)
{
sum[i]=sum[i-1]+X[i];
}
long long int s=1,e=1;
long long int ans=0;
while(s<=e && e<R)
{
//cout<<s<<" "<<e<<endl;
long long int mid=(s+e)/2;
//cout<<mid<<endl;
long long int tmp=(X[mid]*(mid-s+1)-(sum[mid]-sum[s-1])+(sum[e]-sum[mid-1])-X[mid]*(e-mid+1));
//cout<<tmp<<endl;
if(tmp<=B)
{
ans=max(ans,e-s+1);
e++;
}
else s++;
}
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... |