Submission #418205

#TimeUsernameProblemLanguageResultExecution timeMemory
418205dxz05Rice Hub (IOI11_ricehub)C++14
42 / 100
1075 ms460 KiB
#include "ricehub.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; int besthub(int N, int L, int X[], long long B) { int ans = 0; for (int l = 0; l < N; l++){ for (int r = l; r < N; r++){ ll cur = 0, x = X[(l + r) / 2]; for (int i = l; i <= r; i++){ cur += abs(X[i] - x); } if (cur <= B){ ans = max(ans, r - l + 1); } } } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...