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>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define endl '\n'
using namespace std;
using namespace __gnu_pbds;
using ordered_set = tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>;
signed main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
ordered_set st;
int n;
cin>>n;
int arr[n];
for(int i=0;i<n;i++)cin>>arr[i];
int ans=1,mn=arr[0];
st.insert(arr[0]);
for(int i=1;i<n;i++){
if(arr[i]<arr[i-1]){
mn=arr[i];
st.insert(mn);
ans++;
continue;
}
int it=st.order_of_key(mn+(arr[i]!=mn));
int itt=st.order_of_key(arr[i]);
// cout<<i<<' '<<mn<<' '<<it<<' '<<itt<<' ';
if(it==itt){
mn=arr[i];
st.insert(arr[i]);
}else{
mn=arr[i];
st.insert(arr[i]);
ans++;
}
}
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... |