Submission #342962

#TimeUsernameProblemLanguageResultExecution timeMemory
342962David_MMoney (IZhO17_money)C++14
0 / 100
1 ms364 KiB
#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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...