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 main(){
int n; cin >> n;
int arr[n];
int maxi = 1e9;
set<int>s;
for(int i = 0; i < n; i++) cin >> arr[i];
int ans = 1;
s.insert(arr[0]);
for(int i = 1; i < n; i++){
if(arr[i] < arr[i - 1] || arr[i] > maxi){
ans++;
auto tmp = s.upper_bound(arr[i]);
if(tmp == s.end()) maxi = 1e9;
else maxi = *tmp;
}
s.insert(arr[i]);
}
cout << ans << endl;
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... |