Submission #224520

#TimeUsernameProblemLanguageResultExecution timeMemory
224520T0p_쌀 창고 (IOI11_ricehub)C++14
0 / 100
10 ms512 KiB
#include <bits/stdc++.h> #include "ricehub.h" using namespace std; int besthub(int R, int L, int X[], long long B) { int ans = 0; for(int i=0 ; i<R ; i++) { long long temp = B; int l=i-1, r=i+1, now = 0; while(l >= 0 && r < R) { if(temp < X[i] - X[l] && temp < X[r] - X[i]) break ; if(X[i] - X[l] <= X[r] - X[i]) { temp -= (X[i] - X[l]); l--; now++; } else { temp -= (X[r] - X[i]); r++; now++; } } while(l >= 0) { if(temp < X[i] - X[l]) break ; temp -= (X[i] - X[l]); l--; now++; } while(r < R) { if(temp < X[r] - X[i]) break ; temp -= (X[r] - X[i]); r++; now++; } ans = max(ans, now); } 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...