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;
long long s[100001];
int mx;
int besthub(int R, int L, int X[], long long B){
for (int i=0;i<R;i++)
s[i]=(i?s[i-1]:0)+X[i];
for (int i=0;i<R;i++){
int l=i,r=R-1,kq=-1;
while (l<=r){
int mid=(l+r)>>1;
int median=(i+mid)>>1;
if (1LL*X[median]*(median*2-i-mid+1)-s[median]*2+(i?s[i-1]:0)+s[mid]<=B){
kq=mid;
l=mid+1;
}
else
r=mid-1;
}
mx=max(mx,kq-i+1);
}
return mx;
}
# | 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... |