Submission #655210

#TimeUsernameProblemLanguageResultExecution timeMemory
655210PanTkdRice Hub (IOI11_ricehub)C++14
17 / 100
1074 ms468 KiB
#include "ricehub.h" #include <iostream> #include <cmath> typedef long long ll; using namespace std; int besthub(int R, int L, int X[], long long B) { for(ll i = R;i>=1;i--){ for(ll j = 0;j<R-i;j++){ ll cost = 0; ll med = (i)/2+j; for(ll k = j ;k<j+i;k++){ cost+= abs(X[med]-X[k]); } if(cost<=B) return i; } } return 1; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...