#include<bits/stdc++.h>
#include<string.h>
#include <algorithm>
#include <stdlib.h>
#define ll long long
using namespace std;
ll a,b,c,d,e,f,m,i,j,n,h,g,l,r,ka,p,q,k[500005];
map<ll,ll> maa,mii,mee;
vector<ll> vis,vo,vi;
pair<ll,ll> t;
int main(){
cin>>a;
for(i=0 ; i<a ; i++){
cin>>k[i];
if(maa[k[i]]==0){
mee[k[i]]=i+1;
}
else{
mee[k[i]]=i+1;
}
}
for(i=0 ; i<a ; i++){
if(mee[k[i]]==0){
mee[k[i]]=maa[k[i]];
}
}
g=1;
while(g<=a){
for(i=g ; i<=mee[k[g-1]] ; i++){
cout<<k[g-1]<<endl;
}
g=mee[k[g-1]]+1;
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |