# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
960949 | tudor_costin | Cat Exercise (JOI23_ho_t4) | C++11 | 75 ms | 15444 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 <iostream>
using namespace std;
const int Nmax=2e5+5;
int aint[4*Nmax];
int a[Nmax];
int pos[Nmax];
int n;
int sol=0;
void build(int nod,int l,int r)
{
if(l==r)
{
aint[nod]=a[l];
return;
}
int mid=(l+r)/2;
build(2*nod,l,mid);
build(2*nod+1,mid+1,r);
aint[nod]=max(aint[2*nod],aint[2*nod+1]);
return;
}
int query(int nod,int l,int r,int st,int dr)
{
if(st<=l && r<=dr) return aint[nod];
int mid=(l+r)/2;
if(dr<=mid) return query(2*nod,l,mid,st,dr);
if(mid<st) return query(2*nod+1,mid+1,r,st,dr);
return max(query(2*nod,l,mid,st,mid),query(2*nod+1,mid+1,r,mid+1,dr));
}
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |