# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
65926 | ikura355 | Cake (CEOI14_cake) | C++14 | 659 ms | 6300 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 maxn = 250000 + 5;
int n,st,q;
int a[maxn];
int pos[maxn];
int limit;
int seg[maxn*4];
void init() {
limit = 1;
while(limit<=n) limit*=2;
}
void update(int x, int val) {
x += limit;
seg[x] = val;
while(x) {
x/=2;
seg[x] = max(seg[x<<1], seg[x<<1|1]);
}
}
int query(int l, int r) {
int ans = 0;
l += limit; r += limit;
while(l<r) {
if(l%2!=0) ans = max(ans, seg[l++]);
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |