# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
493999 | Leo121 | 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 "ricehub.h"
typedef long long ll;
int arre[100002];
ll presupuesto;
int campos;
bool probar(int campos_arroz){
ll aux = 0;
int centro = campos_arroz / 2;
for(int i = 0; i < campos_arroz; ++i){
aux += abs((ll) arre[centro] - (ll) arre[i]);
}
if(aux <= presupuesto){
return 1;
}
for(int i = campos_arroz; i < campos; ++i){
centro++;
aux -= (ll) arre[centro - 1] - (ll) arre[i - campos_arroz];
aux += (ll) arre[i] - (ll) arre[centro];
if(campos_arroz % 2 == 0){
aux -= ((ll) arre[centro] - (ll) arre[centro - 1]);
}
if(aux <= presupuesto){
return 1;
}
}
return 0;
}
int bs(int li, int ls){
int mitad, resbs = 0;
while(li <= ls){
mitad = (li + ls) / 2;
if(probar(mitad)){
resbs = mitad;
li = mitad + 1;
}
else{
ls = mitad - 1;
}
}
return resbs;
}
int besthub(int R, int L, int X[], long long B)
{
presupuesto = B;
for(int i = 0; i < R; ++i){
arre[i] = X[i];
}
campos = R;
return bs(1, R);
}