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 "ricehub.h"
using namespace std;
int besthub(int R, int L, int X[], long long B)
{
long long b;
int sum = 0;
for(int x = 1; x<=L; x++)
{
b = B;
int l, r;
l = lower_bound(X, X+R, x)-X+-1;
r = l+2;
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;
}
# | 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... |