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;
int besthub(int R, int L, int X[], long long B) {
int ans = 0;
for (int i = 0; i < R; i++) {
long long b = 0;
for (int j = i; j > 0; j--) {
b += X[i] - X[j];
for (int k = i; k < R; k++) {
b += X[k] - X[i];
if ( b <= B) {
ans = max(ans, k - j + 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... |