Submission #1591634

---

Source Code Expand

#include <vector>
#include <algorithm>
#include <iostream>
#include <cassert>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <cstdio>
#include <ctime>
#include <map>
#include <set>
#include <string>
#include <cassert>

#define INFLL 2000000000000000000
#define INF 2000000000
#define MOD 1000000007
#define PI acos(-1.0)

using namespace std;

typedef pair <int, int> pii;
typedef long long ll;
typedef vector <ll> vll;

int cnt[100001];
int n;

int main() {
	//freopen("input.txt", "r", stdin);
	//freopen("output.txt", "w", stdout);
	cin >> n;
	int ans = -INF;
	for (int i = 0; i < n; i++) {
		int a;
		cin >> a;
		cnt[a]++;
		ans = max(ans, cnt[a]);
		if (a < 100000) {
			cnt[a + 1]++;
			ans = max(ans, cnt[a + 1]);
		}			
		if (a > 0) {
			cnt[a - 1]++;
			ans = max(ans, cnt[a - 1]);
		}	
	}
	cout << ans << endl;
	return 0;
}

Submission Info

Judge Result