# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
516272 | Jesus | Rice Hub (IOI11_ricehub) | C++14 | 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 <iostream>
#include "ricehub.h"
int besthub(int R, int L,int X[], long long int B){
long long int izq=0, der=0, maxim=0;
long long int costo=0;
int i=0,j=0;
int z=0;
while(i<R){
if(j==R-1||costo>B) {
if(izq<der){
z=(i+j)/2;
costo-=X[z+1]-X[z-izq];
costo+=(X[z+1]-X[z])*(izq);
costo-=(X[z+1]-X[z])*(der);
izq++;
der--;
}
i++;
izq--;
}
else{
z=(i+j)/2;
if(izq<der){
costo+=X[z+1+der]-X[z+1];
costo+=(X[z+1]-X[z])*izq;
costo-=(X[z+1]-X[z])*(der-1);
izq++;
der--;
}
else{
costo+=X[z+der+1]-X[z];
}
j++;
der++;
}
if(costo<=B) maxim=max(maxim,der+izq+1);
}
return maxim;
}