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 <vector>
int besthub(int R, int L, int X[], long long B)
{
std::vector<long long> prefix({0});
for(int i=0;i<R;i++){
prefix.push_back(prefix.back()+X[i]);
}
int best=0;
int j=1;
for(int i=1;i<=R;i++){
while(true){
int kl=(i+j)/2;
int kr=(i+j+1)/2;
long long cost=(prefix[i]-prefix[kr-1])-(prefix[kl]-prefix[j-1]);
if(cost<=B) break;
j++;
}
best=std::max(best,i-j+1);
}
return best;
}
# | 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... |