| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 734392 | Amaarsaa | Global Warming (NOI13_gw) | C++14 | 1055 ms | 55556 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 ll = long long;
ll n, ans, p, j, s, x;
int main() {
ll i, t, r;
cin >> n;
map < int, int > Used, Howmuch;
vector < pair < ll, ll > > v;
for ( i = 1; i <= n; i ++) {
cin >> x;
Howmuch[x] ++;
v.push_back(make_pair(x, i));
}
ans = 0;
sort ( v.begin(), v.end());
r = 0;
for ( i = n - 1; i >= 0; i --) {
x = v[i].second;
if ( Howmuch[v[i].first] == 1) {
ans ++;
if ( Used[x + 1] == 1) ans --;
if ( Used[x - 1] == 1) ans --;
Used[x] ++;
}
Howmuch[v[i].first] --;
r = max (r, ans);
}
cout << r << endl;
}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... | ||||
