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;
long long sum = 0;
int besthub(int R, int L, int X[], long long B)
{
sort(X, X+R);
int ptr = 0;
int ans = 0;
for(int i=0; i<R; i++) {
if(ptr < i) {
ptr = i;
sum = 0;
}
while(ptr<R-1 && sum - X[(i+ptr+1)/2] + X[ptr+1] <= B) {
sum = sum - X[(i+ptr+1)/2] + X[ptr+1];
ptr++;
}
ans = max(ans, ptr-i+1);
sum = sum + X[i] - X[(i+ptr+1)/2];
}
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... |