#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; typedef long long int ll; typedef unsigned int uint; typedef unsigned char uchar; typedef unsigned long long ull; typedef pair pii; typedef pair pll; typedef vector vi; #define REP(i,x) for(int i=0;i<(int)(x);i++) #define REPS(i,x) for(int i=1;i<=(int)(x);i++) #define RREP(i,x) for(int i=((int)(x)-1);i>=0;i--) #define RREPS(i,x) for(int i=((int)(x));i>0;i--) #define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();i++) #define RFOR(i,c) for(__typeof((c).rbegin())i=(c).rbegin();i!=(c).rend();i++) #define ALL(container) (container).begin(), (container).end() #define RALL(container) (container).rbegin(), (container).rend() #define SZ(container) ((int)container.size()) #define mp(a,b) make_pair(a, b) #define pb push_back #define eb emplace_back #define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() ); template bool chmax(T &a, const T &b) { if (a bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; } template ostream& operator<<(ostream &os, const vector &t) { os<<"["; FOR(it,t) {if(it!=t.begin()) os<<","; os<<*it;} os<<"]"; return os; } template ostream& operator<<(ostream &os, const set &t) { os<<"{"; FOR(it,t) {if(it!=t.begin()) os<<","; os<<*it;} os<<"}"; return os; } template ostream& operator<<(ostream &os, const pair &t) { return os<<"("< pair operator+(const pair &s, const pair &t){ return pair(s.first+t.first, s.second+t.second);} template pair operator-(const pair &s, const pair &t){ return pair(s.first-t.first, s.second-t.second);} const int INF = 1<<28; const double EPS = 1e-8; const int MOD = 1000000007; int T, n, m; int main(int argc, char *argv[]){ ios::sync_with_stdio(false); cin >> n; unordered_map mp; REP(i, n){ int x; cin >> x; if(!mp.count(x)) mp[x].first = i; mp[x].second = i + 1; } vector ev; for(auto it : mp){ ev.eb(it.second.first, it.first); ev.eb(it.second.second, -it.first); } sort(ALL(ev)); vi ans(n); int i = 0; set s; for(auto it : ev){ int t, x; tie(t, x) = it; while(i < t) ans[i++] = *s.rbegin(); if(x > 0) s.insert(x); else s.erase(-x); } REP(i, n) cout << ans[i] << " \n"[i+1 == n]; return 0; }