# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
224620 | 2020-04-18T14:00:29 Z | DanerZein | Rice Hub (IOI11_ricehub) | C++14 | 0 ms | 0 KB |
#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,tamxo); } } } return ma; }