数学做法：找众数，并输出众数的个数，但是WA #14

#include<bits/stdc++.h>
using namespace std;
int main(){
	long long n,m = -1e6,ans = -1e6;
	long long a[100005],b[100005];      
	scanf("%lld",&n);
	for (int i = 1;i <= n;i++){         
		scanf("%lld",&a[i]);
		b[a[i]]++;                      
		m = max(m,a[i]);                
	}
	for (int i = 1;i <= m;i++){
		ans = max(ans,b[i]);
	}
	printf("%lld\n",ans);
	return 0;
}