This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#define fn(n) for(int i=1; i<=n; i++)
using namespace std;
using ll=long long;
int n;
int a[200002];
map<int, int> s;
map<int, int> f;
void nhap(){
cin >> n;
for(int i=1; i<=n; i++){
cin >> a[i];
s[a[i]]=i;
if(f[a[i]]==0) f[a[i]]=i;
}
}
void solve(){
int l=1;
while(l<=n){
for(int i=l; i<=s[a[l]]; i++){
a[i]=a[l];
}
l=s[a[l]]+1;
}
for(int i=1; i<=n; i++){
cout << a[i] << '\n';
}
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
nhap();
solve();
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |