Submission #1595639

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <iostream>
using namespace std;

int main (void)
{
    int s[150000] = {0};
    int n;
    int i;
    int ans[150000] = {0};
    long long max = 0;
    int c[150000] = {0};
    scanf("%d",&n);
    for(i=0;i<n;i++){
        scanf("%d",&s[i]);
    }
    sort(s,s+n);
    
    for(i=0;i<n;i++){
        c[s[i]]++;
    }
    for(i=0;i<s[n-1];i++){
        ans[i] = c[i] + c[i+1] + c[i+2];
    }
    for(i=0;i<s[n-1];i++){
        if(ans[i] > max){
            max = ans[i];
        }
    }
    /*for(i=0;i<s[n-1];i++){
        printf("%d\n",ans[i]);
    }*/
    /*for(i=0;i<s[n-1]-2;i++){
        printf("%d\n",ans[i]);
    }*/
    printf("%lld\n",max);

    return 0;
    
}

Submission Info

Judge Result