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 ll long long
#define pll pair<ll,ll>
#define pii pair<int,int>
#define fs first
#define sc second
#define tlll tuple<ll,ll,ll>
const int mxn = 1e6+10;
int n;
set<int> st;
int ans = 0;
int arr[mxn];
int main(){
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin>>n;
for(int i = 1;i<=n;i++)cin>>arr[i];
st.insert(0);
st.insert(n+1);
st.insert(arr[1]);
int ans = 1;
for(int i = 2;i<=n;i++){
if(arr[i]<arr[i-1])ans++;
else{
auto lit = st.upper_bound(arr[i-1]);
auto rit = st.upper_bound(arr[i]);
if(lit != st.end()&&lit != rit)ans++;
else st.insert(arr[i]);
}
}
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... |