Submission #2166852

---

Source Code Expand

#define _USE_MATH_DEFINES 
#include<iomanip> 
#include<cmath>  
#include<iostream>
#include<fstream>
#include<vector>
#include<algorithm>
#include<numeric>
#include<bitset>
#include<map>
#include<unordered_map>
#include<set>
#include<unordered_set>
#include<queue>
#include<deque>
#include<stack>
using namespace std;
typedef long long ll;
#define repi(i,a,b) for(ll i = (ll)(a) ; i < (ll)(b) ; i++)
#define repd(i,a,b) for(ll i = (ll)(a) ; i > (ll)(b) ; i--)
#define rd(x) cin >> x
#define wr(x)  cout << x
#define wrln(x) cout << x << endl

ll n, a[100000 + 10], ans;

int main() {
	rd(n);
	repi(i, 0, n) {
		ll t;
		rd(t);
		if (t > 0) a[t - 1]++;
		a[t]++;
		a[t + 1]++;
	}
	repi(i, 0, 100000 + 10) {
		ans = max(ans, a[i]);
	}
	wrln(ans);
	return 0;
}

Submission Info

Judge Result