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>
#define ll long long
using namespace std;
ll ans=1,cur,i,sz=1,med,fi=1;
int besthub(int R, int L, int X[], long long B)
{
for(i=1;i<R;i++){
sz++;
if(sz%2==1){
cur+=(X[i]-X[med]);
}
else{
cur+=(X[med+1]-X[med]);
med++;
cur+=(X[i]-X[med]);
}
while(cur>B){
sz--;
fi++;
if(sz%2==1){
cur-=(X[med]-X[fi]);
}
else{
cur+=(X[med+1]-X[med]);
med++;
cur-=(X[med]-X[fi]);
}
}
ans=max(ans,sz);
}
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... |