# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
92358 | Pajaraja | Global Warming (CEOI18_glo) | C++17 | 676 ms | 19160 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>
#define MAXN 2000007
using namespace std;
int a[MAXN],v[MAXN],seg[2][4*MAXN],dp[2][MAXN];
map<int,int> m;
void upd(int k,int l,int r,int val,int pos,int ind)
{
if(l==r) {seg[k][ind]=val; return;}
int s=(l+r)/2;
if(pos<=s) upd(k,l,s,val,pos,2*ind);
else upd(k,s+1,r,val,pos,2*ind+1);
seg[k][ind]=max(seg[k][2*ind],seg[k][2*ind+1]);
}
int nmax(int k,int l,int r,int lt,int rt,int ind)
{
if(l>rt || r<lt) return 0;
if(l>=lt && r<=rt) return seg[k][ind];
int s=(l+r)/2;
return max(nmax(k,l,s,lt,rt,2*ind),nmax(k,s+1,r,lt,rt,2*ind+1));
}
int binarna(int l,int r,int val)
{
if(l==r) return l+1;
int s=(l+r+1)/2;
if(v[s]>=val) return binarna(l,s-1,val);
return binarna(s,r,val);
}
int main()
{
int n,x;
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |