제출 #121026

#제출 시각아이디문제언어결과실행 시간메모리
121026turbat쌀 창고 (IOI11_ricehub)C++14
100 / 100
47 ms2552 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 == 0) 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(i, mid) <= B) l = mid; else r = mid - 1; } ans = max(ans, l - i + 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...