# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
171295 | juggernaut | Money (IZhO17_money) | C++14 | 4 ms | 504 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
//Just try and the idea will come!
#include<bits/stdc++.h>
#define int long long int
using namespace std;
int n,i,nxt[1000001],prv[1000001],a[1000001],b[1000001],ans,x,y;
main(){
scanf("%lld",&n);
for(i=1;i<=n;i++){
scanf("%lld",&a[i]);
b[i]=a[i];
}
a[0]=1e15;
sort(b+1,b+1+n);
for(i=1;i<n;i++)nxt[b[i]]=b[i+1],prv[b[i+1]]=b[i];
i=n;
while(i>1){
x=nxt[i];
while(prv[a[i]]==a[i-1])i--;
prv[x]=prv[i];
nxt[i]=nxt[x];
ans++;
i--;
}
printf("%lld",ans);
}
Compilation message (stderr)
# | 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... |