| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 120042 | turbat | 자동 인형 (IOI18_doll) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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 + 1) / 2;
return s[r] + s[l - 1] - s[mid] - s[mid - 1];
}
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;
}