// clang-format off #include<bits/stdc++.h> using namespace std; using LL=long long; #define FOR(i,l,r) for(auto i=(l);i<=(r);++i) #define REP(i,n) FOR(i,0,(n)-1) #define ssize(x) int(x.size()) template<class A,class B>auto&operator<<(ostream&o,pair<A,B>p){return o<<"("<<p.first<<", "<<p.second<<")";} template<class T>auto operator<<(ostream&o,T x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<(", ")+2*!i++<<e;return o<<"}";} #ifdef DEBUG #define debug(x...) cerr<<"["#x"]: ",[](auto...$){((cerr<<$<<"; "),...);}(x),cerr<<'\n' #else #define debug(...) {} #endif // clang-format on int main() { cin.tie(0)->sync_with_stdio(0); int n, tmp; unordered_map<int, int> cnt; cin >> n; REP (i, n) { cin >> tmp; cnt[tmp]++; } debug(cnt); vector<int> dp(n + 1); for (const auto& c : cnt) { FOR (i, 1, c.second) dp[c.second / i] += 1; } for (int i = n - 1; i >= 1; --i) dp[i] += dp[i + 1]; debug(dp); FOR (k, 1, n) cout << dp[k] * k << " "; cout << "\n"; return 0; }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 | // clang-format off #include<bits/stdc++.h> using namespace std; using LL=long long; #define FOR(i,l,r) for(auto i=(l);i<=(r);++i) #define REP(i,n) FOR(i,0,(n)-1) #define ssize(x) int(x.size()) template<class A,class B>auto&operator<<(ostream&o,pair<A,B>p){return o<<"("<<p.first<<", "<<p.second<<")";} template<class T>auto operator<<(ostream&o,T x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<(", ")+2*!i++<<e;return o<<"}";} #ifdef DEBUG #define debug(x...) cerr<<"["#x"]: ",[](auto...$){((cerr<<$<<"; "),...);}(x),cerr<<'\n' #else #define debug(...) {} #endif // clang-format on int main() { cin.tie(0)->sync_with_stdio(0); int n, tmp; unordered_map<int, int> cnt; cin >> n; REP (i, n) { cin >> tmp; cnt[tmp]++; } debug(cnt); vector<int> dp(n + 1); for (const auto& c : cnt) { FOR (i, 1, c.second) dp[c.second / i] += 1; } for (int i = n - 1; i >= 1; --i) dp[i] += dp[i + 1]; debug(dp); FOR (k, 1, n) cout << dp[k] * k << " "; cout << "\n"; return 0; } |