# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
73125 | win11905 | Global Warming (CEOI18_glo) | C++11 | 260 ms | 7016 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;
#define pii pair<int, int>
#define x first
#define y second
const int N = 2e5+5;
int n, x, A[N], pos[N];
int ret[N], t[N<<1];
void update(int x, int v) {
for(t[x+=n] = v; x != 1; x >>= 1) t[x>>1] = max(t[x], t[x^1]);
}
int query(int r) {
int l = 0, mx = 0;
for(l += n, r += n+1; l < r; l >>= 1, r >>= 1) {
if(l & 1) mx = max(mx, t[l++]);
if(r & 1) mx = max(mx, t[--r]);
}
return mx;
}
int main() {
scanf("%d %d", &n, &x);
vector<int> V, Z;
vector<pii> ret;
for(int i = 1; i <= n; ++i) scanf("%d", A+i), Z.emplace_back(A[i]), ret.emplace_back(A[i], i);
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... |