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"
#define LL long long
long long f(int x, int y, int *r){
if((y-x+1)%2) return r[y+1]-r[(x+y)/2];
return r[y+1]-r[(x+y)/2+1];
}
int besthub(int n, int max_L, int in[], long long B){
int x=0, y=0, out=0;
long long sum=0;
while(x<n){
while(y+1<n && sum+f(x,y,in)<=B) sum+=f(x,y,in), y++;
out=out>y-x+1?out:y-x+1, x++;
} return out;
}
# | 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... |