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;
long long a[100010],ps[100010];
long long cost(long long l,long long r){
long long mid=(l+r)>>1;
long long ls=a[mid]*(mid-l)-ps[mid-1]+ps[l-1];
long long rs=ps[r]-ps[mid]-a[mid]*(r-mid);
return ls+rs;
}
int besthub(int R, int L, int X[], long long B){
for (int i=0; i<R; i++) a[i+1]=X[i];
for (int i=1; i<=R; i++) ps[i]=ps[i-1]+a[i];
long long ans=0,cur=0;
for (int i=1; i<R; i++){
while (cur<R&&B>=cost(i,cur+1)) cur++;
ans=max(ans,cur-i+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... |