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;
typedef long long ll;
/// for NC MoonDance
int besthub(int R, int L, int X[], long long B){
vector<ll>x(R), p(R);
for(int i=0;i<R;i++){
x[i] = X[i];
p[i] = x[i];
if(i)p[i] += p[i-1];
}
ll INF = 7e18;
ll ans = 1;
for(int i=0;i<R;i++){
ll l = 1, r = R;
while(l<r){
ll m = (l+r+1)/2;
ll l_, r_;
ll sum = INF;
if(m%2){
l_ = i-m/2; r_ = i+m/2;
if(0<=l_&&r_<R){
sum = p[r_] - p[i] - (x[i]*(r_-i));
sum += x[i]*(i-l_+1) - (!l_ ? 0 : p[i]-p[l_-1]);
}
}
else{
ll s1=INF,s2=INF;
l_ = i-m/2+1; r_ = i+m/2;
if(0<=l_&&r_<R){
s1 = p[r_] - p[i] - (x[i]*(r_-i));
s1 += x[i]*(i-l_+1) - (!l_ ? 0 : p[i]-p[l_-1]);
}
l_ = i-m/2; r_ = i+m/2-1;
if(0<=l_&&r_<R){
s2 = p[r_] - p[i] - (x[i]*(r_-i));
s2 += x[i]*(i-l_+1) - (!l_ ? 0 : p[i]-p[l_-1]);
}
sum = min(s1,s2);
}
if(sum <= B)l = m;
else r = m-1;
}
ans = max(ans, l);
}
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... |