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 N = 1e6 + 5;
int n, a[N], ans;
set < int > q;
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin >> n;
for(int i = 1; i <= n; i++){
cin >> a[i];
}
for(int i = 1; i <= n; i++){
ans += 1;
int j = i + 1;
while(j <= n && a[j] >= a[j - 1]){
auto it = q.upper_bound(a[i]);
if(it == q.end() || a[j] <= *it){
j += 1;
}
else{
break;
}
}
//cout << i << " " << j << "\n";
for(int k = i; k < j; k++){
q.insert(a[k]);
}
i = j;
i -= 1;
}
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... |