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;
const int N=1000006;
int i,n,s,a[N],l[N],r[N],ans,x;
pair<int, int> p[N];
int main(){
cin>>n;
for (i=1; i<=n; i++)cin>>a[i],p[i]={a[i],i};
sort(p+1, p+n+1);
for (i=1; i<=n; i++)r[p[i].second]=p[i+1].first,l[p[i].second]=p[i-1].first;
for (i=n; i>=2; i--)ans+=(l[i]!=a[i-1]),x=l[i],l[i]=a[r[i]],r[i]=a[x];
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... |