Submission #1557453

---

Source Code Expand

#include<iostream>
#include<iomanip>
#include<math.h>
#include<vector>
#include<algorithm>
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<string>
#define INF 1000000000ll
#define MOD 1000000007ll
#define EPS 1e-8
#define REP(i,m) for(long long i=0; i<m; ++i)
#define FOR(i,n,m) for(long long i=n; i<m; ++i)
#define ALL(v) v.begin(),v.end()
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef long double ld;
typedef vector<int> vi;
typedef vector<vector<int> > vii;
typedef vector<long long> vl;
typedef vector<vector<long long> > vll;
typedef vector<P> vp;
typedef vector<vector<P> > vpp;

int main() {
	int n;
	cin>>n;
	vl a(n);
	REP(i,n) cin>>a[i];
	vector<ll> c(1e5+1,0);
	REP(i,n) {
		++c[a[i]];
		++c[a[i]+1];
		++c[a[i]+2];
	}
	ll res=0;
	REP(i,1e5+1) {
		res=max(res,c[i]);
	}
	cout<<res<<endl;
}

Submission Info

Judge Result