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>
#define ll long long
#define ff first
#define ss second
using namespace std;
int main(){
int n;
cin>>n;
multiset<int> s;
int a[n+1];
for(int k=1;k<=n;k++){
cin>>a[k];
}
ll l=1;
ll ans=0;
multiset<int>::iterator it;
for(int k=2;k<=n;k++){
it=s.upper_bound(a[l]);
if(a[k]<a[k-1]){
ans++;
for(int i=l;i<=k-1;i++)
s.insert(a[i]);
l=k;
continue;
}
if(it==s.end()){
continue;
}
int ind=*it;
if(ind<a[k]){
ans++;
for(int i=l;i<=k-1;i++)
s.insert(a[i]);
l=k;
continue;
}
}
cout<<ans+1;
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... |