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>
using namespace std;
vector<long long> vec;
int besthub(int R, int L, int X[], long long B)
{
int ans = 0;
for(int i=max(0, (R/2)-100);i<min(R, (R/2)+100);i++) {
int now = 0;
vec.clear();
for(int j=0;j<R;j++) {
vec.push_back(abs(X[j] - X[i]));
}
sort(vec.begin(), vec.end());
long long cou = 0;
for(auto t:vec) {
cou += t;
if (cou>B) break;
now++;
}
ans = max(ans, now);
}
return ans;
}
| # | 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... |