# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
410821 | LouayFarah | 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>
#include "racehub.h"
using namespace std;
int besthub(int R, int L, int X[], long long B)
{
if(R==1)
return 1;
if(B==0)
return 1;
long long b;
int sum = 0;
for(int x = 1; x<=L; x++)
{
b = B;
int l = x-1, r = x+1;
int res = 0;
while((r<R||l>=0)&&(b>=0))
{
if(l<0)
{
res++;
b-=abs(x-X[r]);
r++;
}
else if(r==R)
{
res++;
b-=abs(x-X[l]);
l--;
}
else if(abs(X[l]-x)<=abs(X[r]-x))
{
res++;
b-=abs(x-X[l]);
l--;
}
else if(abs(X[l]-x)>abs(X[r]-x))
{
res++;
b-=abs(x-X[r]);
r++;
}
}
sum = max(sum , res);
}
return sum;
}