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 S(int X[], int h, int l, int r)
{
int sum = 0;
for(int i = l; i<r; i++)
sum = sum + abs(h-X[l]);
return sum;
}
int besthub(int R, int L, int X[], long long B)
{
//int l = 0, r = R-1;
int res = 0;
for(int k = 1; k<=R; k++)
{
int l = 0;
int r = k;
while(r<=R)
{
int mid = (l+r)/2;
int h = X[mid];
int curr = S(X, h, l, r);
if(curr<=B)
res = max(res, k);
r++, l++;
}
}
return res;
}
# | 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... |