#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; using int64 = long long; constexpr int64 infll = (1LL << 62) - 1; constexpr int inf = (1 << 30) - 1; struct IoSetup { IoSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(10); cerr << fixed << setprecision(10); } } iosetup; template ostream &operator<<(ostream &os, const pair &p) { os << p.first << " " << p.second; return os; } template istream &operator>>(istream &is, pair &p) { is >> p.first >> p.second; return is; } template ostream &operator<<(ostream &os, const vector &v) { for (int i = 0; i < static_cast(v.size()); i++) { os << v[i] << (i + 1 != v.size() ? " " : ""); } return os; } template istream &operator>>(istream &is, vector &v) { for (T &in: v) is >> in; return is; } template bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); } template bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); } template vector make_v(size_t a) { return vector(a); } template auto make_v(size_t a, Ts... ts) { return vector(ts...))>(a, make_v(ts...)); } template enable_if_t == 0> fill_v(T &t, const V &v) { t = v; } template enable_if_t != 0> fill_v(T &t, const V &v) { for (auto &e: t) fill_v(e, v); } template struct FixPoint : F { explicit FixPoint(F &&f) : F(std::forward(f)) { } template decltype(auto) operator()(Args &&... args) const { return F::operator()(*this, std::forward(args)...); } }; template decltype(auto) MFP(F &&f) { return FixPoint{std::forward(f)}; } int main() { int N; cin >> N; vector< int > A(N); for (auto& a : A) { cin >> a; --a; } vector last(N, -1); int t = 0; auto solve = [&](int k) { int d = 0, ret = 1; for (const auto& a : A) { if (last[a] != t) { last[a] = t; ++d; } if (d > k) { d = 1; ++t; ++ret; last[a] = t; } } ++t; return ret; }; vector< int > ans(N + 2); ans[0] = -inf; ans[N + 1] = inf; auto unos = MFP([&](auto unos, int l, int r) -> void { if (l > r) { return; } if (ans[l - 1] == ans[r]) { for (int k = l; k < r; k++) { ans[k] = ans[l]; } return; } int m = (l + r) / 2; ans[m] = solve(m); unos(l, m - 1); unos(m + 1, r); }); unos(1, N); ans.erase(ans.begin()); ans.pop_back(); for (const auto& a : ans) cout << a << endl; }