AC助手的题解

#include <iostream>
using namespace std;

int main() {
    int n;
    cin >> n;

    // 读取数组
    int arr[n];
    for (int i = 0; i < n; ++i) {
        cin >> arr[i];
    }

    // 确定最大值 Fmax
    int Fmax = 0;
    for (int i = 0; i < n; ++i) {
        if (arr[i] > Fmax) {
            Fmax = arr[i];
        }
    }

    // 初始化计数数组
    int count[Fmax + 1] = {0};

    // 更新计数数组
    for (int i = 0; i < n; ++i) {
        count[arr[i]]++;
    }

    // 输出结果
    for (int i = 0; i <= Fmax; ++i) {
        cout << count[i] << endl;
    }

    return 0;
}