# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1052532 | thatsgonzalez | Mountains (IOI17_mountains) | C++14 | 1 ms | 348 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 "mountains.h"
#include <vector>
#include <bits/stdc++.h>
using namespace std;
struct ST{
vector<int> st, a;
int n;
int query(int p, int lq, int rq, int l, int r){
if(l>r) return 0;
if(r<lq || l>rq) return 0;
if(l>=lq and r<=rq) return st[p];
int mid = (l+r)>>1;
return max(query(p*2+1,lq,rq,l,mid),query(p*2+2,lq,rq,mid+1,r));
}
int query(int l, int r){
return query(0,l,r,0,n-1);
}
void build(int p, int l, int r){
if(l>r) return;
if(l == r){
st[p] = a[l];
}
# | 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... |