Submission #564869

#TimeUsernameProblemLanguageResultExecution timeMemory
564869four_specks쌀 창고 (IOI11_ricehub)C++17
100 / 100
26 ms3336 KiB
#include "ricehub.h" #include <bits/stdc++.h> using namespace std; namespace { } // namespace int besthub(int R, int L, int X[], long long B) { vector<long> pref(R + 1, 0), suff(R + 1, 0); for (int i = 0; i < R; i++) pref[i + 1] = pref[i] + X[i]; for (int i = R - 1; i >= 0; i--) suff[i] = suff[i + 1] - X[i]; int res = 0; for (int i = 0; i < R; i++) { int lo = i, hi = R; while (lo < hi) { int mid = (lo + hi + 1) / 2; int m = (i + mid - 1) / 2; if (pref[mid] - pref[m] + suff[i] - suff[m] + (long)(2 * m - i - mid) * X[m] <= B) lo = mid; else hi = mid - 1; } res = max(res, lo - i); } return res; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...