# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1101842 | blackslex | Global Warming (NOI13_gw) | C++17 | 221 ms | 28088 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;
using pii = pair<int, int>;
int n;
int main() {
scanf("%d", &n);
vector<int> a(n), par(n); iota(par.begin(), par.end(), 0);
vector<bool> ck(n);
for (auto &e: a) scanf("%d", &e);
int cnt = 0, ans = 0;
function<int(int)> fset = [&] (int x) {return (par[x] == x ? x : par[x] = fset(par[x]));};
auto mg = [&] (int x, int y) {
if ((x = fset(x)) == (y = fset(y))) return;
if (ck[x] && ck[y]) cnt--, par[x] = y;
else if (!ck[x] && !ck[y]) cnt++, par[y] = x;
else par[y] = x;
ck[x] = ck[y] = 1;
};
vector<pii> c;
for (int i = 0; i < n; i++) c.emplace_back(a[i], i);
sort(c.begin(), c.end());
for (int i = n - 1; i >= 0; i--) {
int e = c[i].second;
if (e && a[e - 1] >= a[e]) mg(e - 1, e);
if (e != n - 1 && a[e + 1] >= a[e]) mg(e, e + 1);
if (!ck[e]) cnt++, ck[e] = 1;
if (i != n - 1 && c[i].first == c[i + 1].first) continue;
ans = max(ans, cnt);
}
printf("%d", ans);
}
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... |