# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
224621 | DanerZein | 쌀 창고 (IOI11_ricehub) | C++14 | 1078 ms | 784 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){
long long ma=-1;
for(int i=0;i<R;i++){
for(int j=i;j<R;j++){
vector<int>rp;
for(int k=i;k<=j;k++){
rp.push_back(X[k]);
}
int mi=(i+j)/2;
mi=X[mi];
bool sw=0;
long long b=B;
for(int k=0;k<rp.size();k++){
if(b<=0){
sw=1;
break;
}
b-=abs(X[mi]-rp[k]);
//c++;
}
if(sw==1){
long long tam=rp.size();
ma=max(ma,tam);
}
}
}
return ma;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |