# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
224623 | AASG | Rice Hub (IOI11_ricehub) | C++11 | 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;
int besthub(int R, int L, int X[], long long B){
memset(adr,0,sizeof(adr));
for(long i=0;i<R;i++)adr[X[i]]=1;
long mx=0;
for(long i=1;i<=L;i++){
long au=0;
long long ab=B;
deque<long> rm;
for(long l=0;l<R;l++){
rm.push_back(abs(i-R[l]));
}
sort(rm.begin(),rm.end());
for(long l=0;l<rm.size();l++){if(ab-rm[l]>=0){au++;ab=ab-rm[l];}else break;}
mx=max(mx,au);
}
R=mx;
return R;
}