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>
int besthub(int R, int L, int X[], long long B)
{
int maxi= -1, c, a;
long long cp = B;
for(int i=0; i<L; i++)
{
c = 0;
cp = B;
for(int j=0; j<R; j++)
{
a = abs(i-X[j]);
if(a<=cp)
{
cp-=a;
c++;
}
else
{
break;
}
}
if(c>maxi)
{
maxi = c;
}
}
return maxi;
}
# | 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... |