Submission #28849

#TimeUsernameProblemLanguageResultExecution timeMemory
28849kavunRice Hub (IOI11_ricehub)C++14
42 / 100
1000 ms5924 KiB
#include "ricehub.h" #include <bits/stdc++.h> #include "ricehub.h" using namespace std; typedef long long ll; int besthub(int R, int L, int X[], long long B) { for(int res = R; res > 0; res--) { for(int i = 0; i <= R - res; i++) { int median = i + (res - 1) / 2; ll cost = 0; for(int j = i; j < i+res; j++) { cost += abs(X[j] - X[median]); } if(cost <= B) return res; } } 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...