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 <bits/stdc++.h>
#include "ricehub.h"
using namespace std;
#define rep(i,s,e) for (int i = s; i <= e; ++i)
typedef long long ll;
int besthub (int r, int l, int x[], ll b) {
int ans = 1, right = 0, cur = 1;
ll tot = 0;
deque<int> dq;
dq.push_back(x[0]);
rep (i,1,r-1) {
while (right<r-1) {
ll newy = tot;
dq.push_back(x[right+1]);
int nmid = dq[((int)dq.size()-1)/2];
newy += dq.back()-nmid;
if (newy<=b) {
tot = newy;
ans = max(ans, ++cur);
right++;
}
else {
dq.pop_back();
break;
}
}
tot -= dq[((int)dq.size()-1)/2]-dq.front();
if ((int)dq.size()%2==0) tot -= dq[(int)dq.size()/2]-dq[((int)dq.size()-1)/2];
dq.pop_front();
cur--;
}
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... |