Submission #1607173

---

Source Code Expand

#include <iostream>
#include <string>
#include <algorithm>
#include <math.h>
#include <set>
#include <string>
#include <vector>
#include <array>

#define INT_MAX 2000000000
#define MOD 1000000007
#define ll long long;
#define bitget(a,b) (((a) >> (b)) & 1)

using namespace std;

int i, j, k;

int main()
{
	int n;
	int a[100000];
	cin >> n;
	for (i = 0; i < n; i++){
		cin >> a[i];
	}
	int b[100001] = {};
	for (i = 0; i < n; i++){
		b[a[i]]++;
		b[a[i] + 1]++;
		b[a[i] + 2]++;
	}
	int max = 0;
	for (i = 0; i < 100001; i++){
		if (max < b[i]){
			max = b[i];
		}
	}
	cout << max << endl;
	return 0;
}

Submission Info

Judge Result