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 maxn = 1e6+9;
#define int long long
set<int> k; int ans;
signed main() {
int n; cin >> n;
int a[n]; for (int &i:a) cin >> i;
for (int i = 0; i < n;) {
ans++;
int it = *k.upper_bound(a[i]);
k.insert(a[i]); int j = i + 1;
for (; a[j-1]<=a[j] && a[j] <= it && j < n; j++) {
k.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... |