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

#include<bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<ll, ll>PII;
const int N = 2e5 + 10;
const int MOD = 998244353;
const int INF = 0X3F3F3F3F;
const int dx[] = {-1, 1, 0, 0, -1, -1, +1, +1};
const int dy[] = {0, 0, -1, 1, -1, +1, -1, +1};
const int M = 1e6 + 10;

int n;
int a[N];
int main()
{
	cin >> n;
	int maxs = 0;
	for(int i = 1; i <= n; i ++)
	{
		int x;
		cin >> x;
		a[x] ++;//记录次数
		maxs = max(maxs, a[x]);
	}
	cout << (maxs == n ? maxs : maxs + 1) << endl;
}