| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 60997 | nvmdava | 쌀 창고 (IOI11_ricehub) | C++17 | 0 ms | 0 KiB |
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"
bool price(int X[], int l,int r, long long B){
int i;
long long p = 0;
int m = (r + l) / 2;
for(i = l; i <m ; i++){
p +=(long long)X[m] - X[l];
}
for(i = m + 1; i <=r ; i++){
p +=(long long)X[i] - X[m];
}
if(p <= B){
return 1;
} else {
return 0;
}
}
int besthub(int n, int L, int X[], long long B)
{
int l = 0 r = 0, dif = -1;
while(r != n){
if(price(X[] ,l, r, B)){
dif = max(dif, r - l + 1);
r++;
} else {
l++;
}
}
return dif;
}
