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>
#define ll long long
using namespace std;
int besthub(int R, int L, int X[], long long B)
{
ll preS[R + 1] = {0};
for (int i = 1; i <= R; i++)
{
preS[i] = preS[i - 1] + X[i - 1];
}
int ans = 0;
for (int i = 0; i < R; i++)
{
int l = i, r = R - 1;
while(l <= r){
int mid = (l + r) / 2;
int m = (i + mid) / 2;
int placement = X[m];
ll s = -(preS[m + 1] - preS[i] - 1ll * (m - i + 1) * placement) +
(preS[mid + 1] - preS[m] - 1ll * (mid - m + 1) * placement);
if(s <= B){
ans = max(ans, (mid - i + 1));
l = mid + 1;
}
else{
r = mid - 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... |