题解 | #小欧的数组修改#

map老朋友了。

#include <iostream>
#include <queue>
#include <map>
#include <set>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <iomanip>
#include <stack>
#include <numeric>
#include <ctime>
#include <string>
#include <bitset>
#include <unordered_map>
#include <unordered_set>

using namespace std;
using ll = long long;
const ll N = 1e5 + 5, mod = 1e9 + 7, inf = 0x3f3f3f3f;

int n;

map<int, int>mp;

void solve() {
    cin >> n;

    for (int i = 1; i <= n; i++) {
        int x;
        cin >> x;
        mp[x]++;
    }

    int len = mp.size();

    if (len == 1) {
        cout << n;
        return ;
    }

    int ans = 0;

    for (auto i : mp) {
        ans = max(ans, i.second);
    }

    cout << ans + 1;

}

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    int t = 1;
    //cin>>t;

    while (t--) {

        solve();

    }

    return 0;
}