Submission #1558511

---

Source Code Expand

#include <iostream>
#include <fstream>
#include <string>
#include <vector>
#include <map>
#include <list>
#include <algorithm>
#include <cmath>
#include <queue>
#include <iterator>
#include <functional>
#include <numeric>
using namespace std;

#define ll long long
#define forn(i,n)for(i=0;i<n;i++)
#define forc(i,c,n)for(i=c;i<=n;i++)
typedef list<ll> LST;
typedef vector<ll> VEC;
typedef map<ll, ll> MAP;


int main() {
	ifstream fin("Text.txt");
	int i, j, k;
	ll a, b,t, c, e, n,x,y, m, r, d, q,ans=0;
	cin >> n;
	VEC vc(n);
	forn(i, n) {
		cin >> vc[i];
	}
	sort(vc.begin(), vc.end());
	i = 0;
	j = 0;
	while (j<n && i <n)
	{
		if (vc[j] - vc[i] <= 2) {
			ans = max(ans, (ll)(j - i + 1));
			j++;
		}
		else {
			i++;
		}
	}
	cout << ans << endl;
	return 0;
}

Submission Info

Judge Result