# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
988781 | HienTD | Stone Arranging 2 (JOI23_ho_t1) | C++11 | 0 ms | 0 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.
#include <bits/stdc++.h>
using namespace std;
void solve(){
int N; cin >> N;
vector<int> a(N);
for(int i = 0; i < N; i ++) cin >> a[i];
vector<int> ans(N);
map<int, int> mp;
for(int i = 0; i < N; i ++) mp[a[i]] = max(mp[a[i]], i);
int curpos = 0;
while(curpos != 0){
int nextpos = mp[a[curpos]] + 1;
for(int i = curpos; i < nextpos; i ++) ans[i] = a[curpos];
curpos = nextpos;
}
for(int i = 0; i < n; i ++) cout << ans[i] << endl;
}
signed main(){
ios::sync_with_stdio(0);
cin.tie(0);
solve();
}