Submission #1558497

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <vector>
using namespace std ;
#define ll long long int  
ll tab[100001] ; 

int main()
{ 
  ll n ; 
  cin>>n ; 
  ll arr[n] ; 
  for(ll i = 0  ; i< n ; ++i)
    {	cin>>arr[i] ; 
         tab[arr[i]]++ ; 
     }
     ll ans = max(tab[0] + tab[1]  , tab[100000] + tab[99999] ) ; 

     for(ll i = 1 ;  i < n ; ++i   )
       {

          ans =  max( ans , tab[i] + tab[i-1] + tab[i + 1]) ; 

       }
cout<<ans ; 

  
	
return  0 ; }

Submission Info

Judge Result