Submission #121019

#TimeUsernameProblemLanguageResultExecution timeMemory
121019turbat쌀 창고 (IOI11_ricehub)C++14
0 / 100
6 ms640 KiB
#include <bits/stdc++.h> #include "ricehub.h" using namespace std; long long s[100005]; long long can(int l, int r){ int mid = (l + r) / 2; if ((r - l) % 2) return s[r] + s[l - 1] - s[mid] - s[mid - 1]; return s[r] + s[l - 1] - 2 * s[mid]; } int besthub(int R, int L, int X[], long long B){ int ans = 0; for (int i = 1;i <= R;i++) s[i] = s[i - 1] + X[i - 1]; for (int i = 1;i <= R;i++){ int l = i, r = R, mid; while (l != r){ mid = (l + r + 1) / 2; if (can(l, mid) <= B) l = mid; else r = mid - 1; } ans = max(ans, l - i + 1); } return ans; } // s[r] - s[mid] - s[mid] + s[l - 1] // 2 5 14 33 67 // 9 + 19 = 28 + 12 + 43 = 93 // 100
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...