Submission #1558512

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#define TASK ""
#define openfile ({freopen(TASK".inp", "r", stdin); freopen(TASK".out", "w", stdout);})

const int N = 100005;

int n;
int a[N];
map <int, int> f;

int main() {
	//openfile;
	cin >> n;
	for (int i = 1; i <= n; i++) cin >> a[i], f[a[i]]++;
	sort(a + 1, a + 1 + n);
	if (f.size() == 1) {
		return cout << n, 0;
	} else if (f.size() == 2) {
		if (a[n] - a[1] == 1 || a[n] - a[1] == 2) return cout << n, 0;
		int cnt1 = 0, cnt2 = 0;
		for (int i = 1; i <= n; i++)
			if (a[i] == a[1]) cnt1++;
			else if (a[i] == a[n]) cnt2++;
		return cout << max(cnt1, cnt2), 0;
	} else {
		int ans = 0;
		for (int i = 1; i <= n; i++) {
			ans = max(ans, f[a[i]] + f[a[i] - 1] + f[a[i] + 1]);
		}
		cout << ans << "\n";
	}
	return 0;
}

Submission Info

Judge Result