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 sum[100000];
int besthub(int R, int L, int X[], long long B)
{
for(int i=0;i<R;i++){
if(i==0) sum[i]=X[i];
else sum[i]=sum[i-1]+X[i];
}
int ans=0;
for(int i=0;i<R;i++){
int l=i,r=R-1;
while(l<r){
int m=(l+r+1)>>1;
int x=i-1+(m-i+1)/2;
int y=m+1-(m-i+1)/2;
if(B>=(sum[m]-sum[y]+X[y]-sum[x]+sum[i]-X[x])){
l=m;
}
else r=m-1;
}
ans=max(ans,l-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... |