# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
551667 | ala2 | Rice Hub (IOI11_ricehub) | C++14 | 416 ms | 2144 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;
int n,d;
int a[1000100];
int b;
int f(int i,int j)
{
int x=(i+j)/2;
x=a[x];
int g=0;
for(int o=i;o<=j;o++)
g+=abs(a[o]-x);
return g;
}
int ok(int mid)
{
for(int i=0;i<n;i++)
{
if(i+mid>=n)
break;
if(f(i,i+mid)<=b)
{
return 1;
}
}
return 0;
}
int besthub(int R, int L, int X[], long long B)
{
n=R;
d=L;
b=B;
for(int i=0;i<n;i++)
a[i]=X[i];
int mx=1;
int l=0;
int r=n;
while(r-l>1)
{
int mid=(l+r)/2;
if(ok(mid))
{
l=mid;
}
else r=mid;
}
int ann=l+1;
//cout<<mx<<endl;
return ann;
}
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... |