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;
int besthub(int R, int L, int X[], long long B)
{
long long int i=0,j=0,curr=0,mi=0,num=1,ans=1;
while(j<R){
if(curr>B){
curr-=(X[mi]-X[i]);
i++;
if(num%2==1){
mi++;
}
num--;
}
else{
j++;
curr+=(X[j]-X[mi]);
ans=max(ans,num);
if(num%2==1){
mi++;
}
num++;
}
}
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... |