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;
int const N = 1e6 + 9;
int a[N];
set <int> t;
int main() {
cin.tie()->sync_with_stdio(0);
int n;
cin >> n;
for(int i = 0; i < n; i ++) cin >> a[i];
t.insert(-1e9);
t.insert(1e9);
int ans = 0;
for(int i = 0; i < n;) {
ans ++;
int pos = *t.upper_bound(a[i]);
t.insert(a[i]);
int j = i + 1;
for(;j < n && a[j] >= a[j - 1] && a[j] <= pos; j ++)
t.insert(a[j]);
i = j;
}
cout << ans;
}
# | 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... |