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

计数。

#include<bits/stdc++.h>
#define int long long
#define double long double
#define x first
#define y second
using namespace std;
typedef long long LL;
typedef long long ll;
typedef pair<int,int> PII;
const int N=3e5+10;
const int M=1e3+10;
int mod=1e9+7;
int a[N];

void solve(){
    int n;cin>>n;
    for(int i=1;i<=n;i++) cin>>a[i];
    map<int,int>mp;
    for(int i=1;i<=n;i++) mp[a[i]]++;
    int ans=0;
    for(auto x:mp) ans=max(ans,x.y);
    if(mp.size()==1) cout<<ans<<"\n";
    else cout<<ans+1<<"\n";
}

signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);
    int _;
    _=1;
    //cin>>_;
    while(_--){
        solve();
    }
}