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