哈希牛比

#include<iostream>
#include<unordered_map>
#include<vector>
using namespace std;

int length,element,maxn=INT32_MIN;
unordered_map<int,int>counts;
int main(){
    cin >> length;
    for (int i=1;i<=length;i++){
        cin>>element;
        maxn=max(maxn,element);
        counts[element]++;
    }
    for (int i=0;i<=maxn;i++) cout<<counts[i]<<endl;
    return 0;
}