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;
typedef long long ll;
int besthub(int N, int L, int X[], long long B) {
int ans = 0;
for (int l = 0; l < N; l++){
for (int r = l; r < N; r++){
ll cur = 0, x = X[(l + r) / 2];
for (int i = l; i <= r; i++){
cur += abs(X[i] - x);
}
if (cur <= B){
ans = max(ans, r - l + 1);
}
}
}
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... |