//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,avx512f") #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #ifdef DEBUG #include "./CompetitiveProgrammingCpp/debug.hpp" #include "./CompetitiveProgrammingCpp/Timer.hpp" #include "./CompetitiveProgrammingCpp/sample.hpp" #else #define dump(...) templateconstexpr inline auto d_val(T a, T b) { return a; } #endif /* macro */ #define FOR(i, b, e) for(ll i = (ll)(b); i < (ll)(e); ++i) #define RFOR(i, b, e) for(ll i = (ll)((e)-1); i >= (ll)(b); --i) #define REP(i, n) FOR(i, 0, (n)) #define RREP(i, n) RFOR(i, 0, (n)) #define REPC(x,c) for(const auto& x:(c)) #define REPI2(it,b,e) for(auto it = (b); it != (e); ++it) #define REPI(it,c) REPI2(it, (c).begin(), (c).end()) #define RREPI(it,c) REPI2(it, (c).rbegin(), (c).rend()) #define REPI_ERACE2(it, b, e) for(auto it = (b); it != (e);) #define REPI_ERACE(it, c) REPI_ERACE2(it, (c).begin(), (c).end()) #define ALL(x) (x).begin(),(x).end() #define cauto const auto& /* macro func */ template inline auto sort(T& t) { std::sort(ALL(t)); } template inline auto rsort(T& t) { std::sort((t).rbegin(), (t).rend()); } template inline auto unique(T& t) { (t).erase(unique((t).begin(), (t).end()), (t).end()); } template inline auto chmax(T& t, const S& s) { if(s > t) { t = s; return true; } return false; } template inline auto chmin(T& t, const S& s) { if(s < t) { t = s; return true; } return false; } inline auto BR() { std::cout << "\n"; } /* type define */ using ll = long long; using VS = std::vector; using VL = std::vector; using VVL = std::vector; using VVVL = std::vector; using VVVVL = std::vector; using VVVVVL = std::vector; using VD = std::vector; template using V = std::vector; template using P = std::pair; using PAIR = P; /* using std */ using std::cout; constexpr char endl = '\n'; using std::cin; using std::pair; using std::string; using std::stack; using std::queue; using std::deque; using std::vector; using std::list; using std::map; using std::unordered_map; using std::multimap; using std::unordered_multimap; using std::set; using std::unordered_set; using std::unordered_multiset; using std::multiset; using std::bitset; using std::priority_queue; /* Initial processing */ struct Preprocessing { Preprocessing() { std::cin.tie(0); std::ios::sync_with_stdio(0); }; }_Preprocessing; /* Remove the source of the bug */ auto pow(signed, signed) { assert(false); } /* define hash */ namespace std { template <> class hash> { public: size_t operator()(const std::pair& x) const { return hash()(1000000000 * x.first + x.second); } }; } /* input */ template std::istream& operator >> (std::istream& is, vector& vec) { for(T& x : vec) is >> x; return is; } /* constant value */ constexpr ll MOD = 1000000007; // constexpr ll MOD = 998244353; //============================================================================================= template class SegmentMap { const SizeType n; std::map mp; auto add(SizeType i, ValType val, bool left = true, bool right = true) { auto it = std::prev(mp.upper_bound(i)); if(right && std::next(it)->second == val) { mp.erase(std::next(it)); } if(left && it->second == val) { return; } mp.emplace(i, val); } auto remove(SizeType l, SizeType r, auto& it) { auto nx = std::next(it)->first; auto val = it->second; auto ret = std::next(it); if(l <= it->first) { ret = mp.erase(it); } if(r < nx - 1) { add(r + 1, val, false, true); } return ret; } auto remove(SizeType l, SizeType r) { auto it = std::prev(mp.upper_bound(l)); while(it->first <= r) { it = remove(l, r, it); } } public: SegmentMap(SizeType n) :n(n) { mp.emplace(-1, -1); mp.emplace(0, -2); mp.emplace(n, -1); } auto output() const { for(auto it = std::next(mp.begin()); it != std::prev(mp.end()); ++it) { std::cout << "[" << it->first << ", " << std::next(it)->first - 1 << "] :" << it->second << std::endl; } } auto update(SizeType l, SizeType r, ValType val) { if(l < 0 || r >= n) { throw std::runtime_error(""); } if(l > r) { throw std::runtime_error(""); } remove(l, r); add(l, val); } auto query(SizeType l, SizeType r) { if(l < 0 || r >= n) { throw std::runtime_error(""); } if(l > r) { throw std::runtime_error(""); } auto it = std::prev(mp.upper_bound(l)); std::deque>> dq; while(it->first <= r) { auto nx = std::next(it)->first; auto nr = std::min(nx - 1, r); auto nl = std::max(l, it->first); dq.emplace_back(it->second, std::pair{nl,nr}); ++it; } return dq; } auto get(SizeType i) { auto it = std::prev(mp.upper_bound(i)); auto nx = std::next(it)->first; auto nr = nx - 1; auto nl = it->first; return std::pair{it->second,std::pair{nl,nr}}; } }; signed main() { ll n; cin >> n; VL a(n); cin >> a; map mp; REP(i, n) { if(mp.find(a[i]) == mp.end()) { mp.emplace(a[i], PAIR{i,i}); } else { chmin(mp[a[i]].first, i); chmax(mp[a[i]].second, i); } } auto segmap = SegmentMap(n); for(const auto& [x, p] : mp) { auto [l, r] = p; segmap.update(l, r, x); } for(const auto& [x, p] : segmap.query(0, n - 1)) { auto [l, r] = p; FOR(_, l, r + 1) { cout << x << " "; } }BR(); }