#include "bits/stdc++.h" using namespace std; #define all(x) x.begin(),x.end() template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << p.first << " " << p.second; } template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { string sep; for (const T &x : v) os << sep << x, sep = " "; return os; } #ifdef LOCAL #include "debug.h" #else #define debug(...) 42 #define ASSERT(...) 42 #endif typedef long long ll; typedef vector<int> vi; typedef vector<vi> vvi; typedef pair<int,int> pi; const int oo = 1e9; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n; cin >> n; vi a(n); for(auto& i : a) cin >> i; sort(all(a)); vi cnts; for(int i=0;i<n;) { int j = i; while(j<n and a[i]==a[j]) ++j; cnts.push_back(j-i); i=j; } sort(all(cnts)); reverse(all(cnts)); vi res; for(int k=1;k<=n;++k) { while(!cnts.empty() and cnts.back()<k) { cnts.pop_back(); } int ans=0; for(int c : cnts) { ans+=c/k; } res.push_back(ans*k); } cout << res << '\n'; }
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 41 42 43 44 45 46 47 | #include "bits/stdc++.h" using namespace std; #define all(x) x.begin(),x.end() template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << p.first << " " << p.second; } template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { string sep; for (const T &x : v) os << sep << x, sep = " "; return os; } #ifdef LOCAL #include "debug.h" #else #define debug(...) 42 #define ASSERT(...) 42 #endif typedef long long ll; typedef vector<int> vi; typedef vector<vi> vvi; typedef pair<int,int> pi; const int oo = 1e9; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n; cin >> n; vi a(n); for(auto& i : a) cin >> i; sort(all(a)); vi cnts; for(int i=0;i<n;) { int j = i; while(j<n and a[i]==a[j]) ++j; cnts.push_back(j-i); i=j; } sort(all(cnts)); reverse(all(cnts)); vi res; for(int k=1;k<=n;++k) { while(!cnts.empty() and cnts.back()<k) { cnts.pop_back(); } int ans=0; for(int c : cnts) { ans+=c/k; } res.push_back(ans*k); } cout << res << '\n'; } |