# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
467654 | jam_xd_ | Rice Hub (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"
#include <bits/stdc++.h>
using namespace std; //si solo era esto me muero >:v.
int besthub(int R, int L, int X[], long long B)
{
for(int i=0;i<R;i++){
deque<int>diferencias;
int suma_d=0, campos=0;
int jamon=0;//auxiliar
for(int j=0;j<R;j++){
int dif=0;
/*dif = i-X[j];
if(dif <= 0)dif = dif * -1;
*/
dif = abs(X[i]-X[j]);
diferencias.push_back(dif);
}
sort(diferencias.begin(), diferencias.end());
for(int k=0;k<diferencias.size();k++){
if(suma_d + diferencias[k] <= B){
suma_d = suma_d + diferencias[k];
campos++;
}else continue;
}
int maximo = max(jamon, campos);
jamon = maximo;
//comparar anterior y el de ahora
//y me quedo con el mayor.
}
return jamon;
}