# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
495612 | 600Mihnea | Triple Jump (JOI19_jumps) | C++17 | 988 ms | 123888 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 = (int) 5e5 + 7;
const int K = 19;
const int INF = (int) 1e9 + 7;
int n;
int q;
int a[N];
int lg[N];
int maxA[K][N];
int nextBigger[N];
int getMaxA(int l, int r) {
if (l > r) {
return -INF;
}
assert(1 <= l && l <= r && r <= n);
int k = lg[r - l + 1];
return max(maxA[k][l], maxA[k][r - (1 << k) + 1]);
}
struct Offer {
int value;
int lft;
int rgh;
};
struct Question {
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |