Submission #2212485

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;
#define mod 1000000007
#define rep(i,a,b) for (int i = a; i <= b; i++)
#define f first
#define s second
#define pb push_back
#define mp make_pair

int n, a[202020], t, ans, l, r;

int main(){
cin >> n;
rep(i, 0, n-1)cin >> a[i];
sort(a, a+n);
l=0;r=0;
while(l<=r && r<n && l<n){
    if(a[r]-a[l]<=2)r++;
    else l++;
    ans = max(r-l, ans);
}
cout << ans << endl;



return 0;}

Submission Info

Judge Result