#include <bits/stdc++.h>
using namespace std;
int n,t,p,a[200001];
map<int,int> m;
int main(){
cin>>n;
for (int i=1;i<=n;i++){
cin>>a[i];
if (m[a[i]]==0) m[a[i]]=-1;
else m[a[i]]=max(m[a[i]],i);
}
t=a[1],p=1;
while (p<=n){
int temp=m[t];
if (temp==0||temp==-1){
p++; t=a[p];
}
else{
for (int i=p;i<=temp;i++) a[i]=t;
p=temp+1; t=a[p];
}
}
for (int i=1;i<=n;i++) cout<<a[i]<<"\n";
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |