#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; //#define int long long typedef long long ll; typedef unsigned long long ul; typedef unsigned int ui; constexpr ll mod = 1000000007; const ll INF = mod * mod; typedef pairP; #define stop char nyaa;cin>>nyaa; #define rep(i,n) for(int i=0;i=0;i--) #define Rep(i,sta,n) for(int i=sta;i=1;i--) #define Rep1(i,sta,n) for(int i=sta;i<=n;i++) #define all(v) (v).begin(),(v).end() typedef pair LP; typedef long double ld; typedef pair LDP; const ld eps = 1e-12; const ld pi = acosl(-1.0); ll mod_pow(ll x, ll n, ll m) { ll res = 1; while (n) { if (n & 1)res = res * x % m; x = x * x % m; n >>= 1; } return res; } struct modint { ll n; modint() :n(0) { ; } modint(ll m) :n(m) { if (n >= mod)n %= mod; else if (n < 0)n = (n % mod + mod) % mod; } operator int() { return n; } }; bool operator==(modint a, modint b) { return a.n == b.n; } modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; } modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; } modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; } modint operator+(modint a, modint b) { return a += b; } modint operator-(modint a, modint b) { return a -= b; } modint operator*(modint a, modint b) { return a *= b; } modint operator^(modint a, ll n) { if (n == 0)return modint(1); modint res = (a * a) ^ (n / 2); if (n % 2)res = res * a; return res; } ll inv(ll a, ll p) { return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p); } modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); } const int max_n = 1 << 1; modint fact[max_n], factinv[max_n]; void init_f() { fact[0] = modint(1); for (int i = 0; i < max_n - 1; i++) { fact[i + 1] = fact[i] * modint(i + 1); } factinv[max_n - 1] = modint(1) / fact[max_n - 1]; for (int i = max_n - 2; i >= 0; i--) { factinv[i] = factinv[i + 1] * modint(i + 1); } } modint comb(int a, int b) { if (a < 0 || b < 0 || a < b)return 0; return fact[a] * factinv[b] * factinv[a - b]; } ll gcd(ll a, ll b) { if (a < b)swap(a, b); while (b) { ll r = a % b; a = b; b = r; } return a; } struct SegT { private: int n; vector node, lazy; const int init_c = 0; public: SegT(vector v) { int sz = v.size(); n = 1; while (n < sz)n <<= 1; node.resize(2 * n - 1, init_c); lazy.resize(2 * n - 1, -1); rep(i, sz) { node[i + n - 1] = v[i]; } } int f(int a, int b) { return max(a, b); } void eval(int k, int l, int r) { if (lazy[k] < 0)return; node[k] = lazy[k]; if (r - l > 1) { lazy[2 * k + 1] = lazy[k]; lazy[2 * k + 2] = lazy[k]; } lazy[k] = -1; } void add(ll x, int a, int b, int k = 0, int l = 0, int r = -1) { if (r < 0)r = n; eval(k, l, r); if (r <= a || b <= l)return; if (a <= l && r <= b) { lazy[k] = x; eval(k, l, r); } else { add(x, a, b, k * 2 + 1, l, (l + r) / 2); add(x, a, b, k * 2 + 2, (l + r) / 2, r); node[k] = f(node[k * 2 + 1], node[k * 2 + 2]); } } int query(int a, int b, int k = 0, int l = 0, int r = -1) { if (r < 0)r = n; eval(k, l, r); if (r <= a || b <= l)return init_c; if (a <= l && r <= b)return node[k]; else { int vl = query(a, b, k * 2 + 1, l, (l + r) / 2); int vr = query(a, b, k * 2 + 2, (l + r) / 2, r); return f(vl, vr); } } }; void solve() { int n; cin >> n; vector a(n); rep(i, n)cin >> a[i]; vector cop = a; sort(all(cop)); cop.erase(unique(all(cop)), cop.end()); rep(i, n) { a[i] = lower_bound(all(cop), a[i]) - cop.begin(); } SegT st(a); vector> loc(cop.size()); rep(i, n)loc[a[i]].push_back(i); rep(i, cop.size()) { vector vs; for (int id : loc[i]) { vs.push_back(id); st.add(i, id, id + 1); } rep(j, (int)vs.size() - 1) { int l = vs[j], r = vs[j + 1]; st.add(i, l, r); } }vector b(n); rep(i, n)b[i] = st.query(i, i + 1); rep(i, n) { if (i > 0)cout << " "; cout << cop[b[i]]; } cout << "\n"; } signed main() { ios::sync_with_stdio(false); cin.tie(0); //cout << fixed << setprecision(15); //init_f(); //expr(); //int t; cin >> t; rep(i, t) solve(); return 0; }