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;
//#define int long long
const int N = 2e5 + 1;
int main(){
ios::sync_with_stdio(0);
cin.tie(0),cout.tie(0);
int n , ans = 0;cin >> n;
set<int> s;
vector<int> a(n + 1);
for(int i = 1;i <= n;i ++){
cin >> a[i];
}
for(int i = 1;i <= n;i ++){
int p = i;
while(p + 1 <= n && (a[p] <= a[p + 1] && (s.upper_bound(a[i]) == s.end() || *s.upper_bound(a[i]) >= a[p + 1]))) ++p;
++ans;
for(int x = i;x <= p;x ++) s.insert(a[x]);
i = p;
}
cout << ans << endl;
}
# | 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... |