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
int N, inp;
vector<int> v;
vector<int> cur;
set<int> s;
int ans;
int32_t main() {
ios::sync_with_stdio(0);
cin >> N;
for(int a=0; a<N; a++){
cin >> inp;
v.push_back(inp);
if(a == 0){
cur.push_back(inp);
continue;
}
if(inp < cur.back()){
ans++;
while(!cur.empty()){
s.insert(cur.back());
cur.pop_back();
}
cur.push_back(inp);
continue;
}
//check if there is num
if(s.lower_bound(inp) != s.upper_bound(cur.back())){
ans++;
while(!cur.empty()){
s.insert(cur.back());
cur.pop_back();
}
cur.push_back(inp);
continue;
}
cur.push_back(inp);
}
cout << ans+1;
}
# | 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... |