Submission #342975

#TimeUsernameProblemLanguageResultExecution timeMemory
342975David_MMoney (IZhO17_money)C++14
0 / 100
1 ms384 KiB
#include <bits/stdc++.h> using namespace std; const int N=1000006; int i,n,s,a[N],b[N],r[N],l[N],f[N],ans,x,y; int main(){ cin>>n; for (i=1; i<=n; i++)cin>>a[i],b[i]=a[i],f[a[i]]++; sort(b+1, b+n+1); for (i=1; i<n; i++)r[b[i]]=b[i+1]; for (i=n; i>1; i--)l[b[i]]=b[i-1]; for (i=n; i>1; i--){x=a[i],y=a[i-1],ans+=(x-y&&l[x]-y);if(--f[x]==0)r[l[x]]=r[x],l[r[x]]=l[x];} cout<<ans+1; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...