Submission #342981

#TimeUsernameProblemLanguageResultExecution timeMemory
342981David_MMoney (IZhO17_money)C++14
100 / 100
534 ms20076 KiB
#include <bits/stdc++.h> using namespace std; const int N=1000006; int i,n,a[N],b[N],r[N],l[N],f[N],ans,x,y,u; 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); u=a[n]; 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]; if(--f[x]==0)r[l[x]]=r[x],l[r[x]]=l[x]; if(x==y)continue; if((f[x]&&x-u)||l[x]-y)ans++,u=y; } 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...