#include<bits/stdc++.h> using namespace std; int main(){ ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); int n; cin >> n; vector<int> a(n); for(int &i : a) cin >> i; sort(a.begin(), a.end()); vector<int> sizy; int cnt = 1; for(int i = 1; i < n; i++){ if(a[i] != a[i-1]){ sizy.push_back(cnt); cnt = 1; } else cnt++; } sizy.push_back(cnt); sort(sizy.begin(), sizy.end()); reverse(sizy.begin(), sizy.end()); int pos = n; for(int k = 1; k <=n; k++){ int res = 0; int i = 0; while(i < pos && sizy[i] >= k){ res += sizy[i] - (sizy[i]%k); i++; } if(i != pos) pos = i; cout << res << " "; } }
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 | #include<bits/stdc++.h> using namespace std; int main(){ ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); int n; cin >> n; vector<int> a(n); for(int &i : a) cin >> i; sort(a.begin(), a.end()); vector<int> sizy; int cnt = 1; for(int i = 1; i < n; i++){ if(a[i] != a[i-1]){ sizy.push_back(cnt); cnt = 1; } else cnt++; } sizy.push_back(cnt); sort(sizy.begin(), sizy.end()); reverse(sizy.begin(), sizy.end()); int pos = n; for(int k = 1; k <=n; k++){ int res = 0; int i = 0; while(i < pos && sizy[i] >= k){ res += sizy[i] - (sizy[i]%k); i++; } if(i != pos) pos = i; cout << res << " "; } } |