# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
564068 | hoanghq2004 | Sure Bet (CEOI17_sure) | C++14 | 85 ms | 3660 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>
using namespace std;
const int N = 1e5 + 10;
int n;
double a[N], b[N], ans = -1e9;
double calc(int i, int j) {
return min(a[i], b[j]) - i - j;
}
void divide(int L, int R, int from, int to) {
if (L > R) return;
int mid = L + R >> 1;
double cur = -1e9;
int best = from;
for (int i = from; i <= to; ++i) {
if (calc(mid, i) > cur) {
cur = calc(mid, i);
best = i;
}
}
ans = max(ans, cur);
divide(L, mid - 1, from, best);
divide(mid + 1, R, best, to);
}
int main() {
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |