Submission #105909

#TimeUsernameProblemLanguageResultExecution timeMemory
105909tincamatei쌀 창고 (IOI11_ricehub)C++14
17 / 100
1067 ms1664 KiB
#include <bits/stdc++.h> #include "ricehub.h" using namespace std; const int MAX_N = 100; int aux[MAX_N]; bool works(int *v, int n, long long B) { for(int i = 0; i < n; ++i) aux[i] = v[i]; sort(aux, aux + n); int med = aux[n / 2]; for(int i = 0; i < n; ++i) B = B - abs(med - aux[i]); return (B >= 0); } int besthub(int R, int L, int X[], long long B) { int l; int rez = 0; // X[l...r] works l = 0; for(int r = 0; r < R; ++r) { while(l < r && !works(X + l, r - l + 1, B)) l++; if(works(X + l, r - l + 1, B)) rez = max(rez, r - l + 1); } return rez; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...