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;
const int nmax = 1e6 + 1;
int v[nmax];
int main() {
int n;
cin >> n;
for(int i = 1; i <= n; i ++) {
cin >> v[i];
}
set<int> s;
s.insert(1e9);
int i = 1, ans = 0;
while(i <= n) {
int x = *s.upper_bound(v[i]);
s.insert(v[i]);
while(i < n && v[i] <= v[i + 1] && v[i + 1] <= x) {
i ++;
s.insert(v[i]);
}
i ++;
ans ++;
}
cout << ans;
return 0;
}
# | 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... |