Submission #1608316

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;

int main() {
    ios::sync_with_stdio(false);
    int n; cin >> n;
    vector<int> a(n);
    for(int i = 0; i < n; ++i) {
        int x; cin >> x;
        a[i] = x;
    }
    sort(a.begin(), a.end());
    int start = a[0];
    int end = a[n-1];
    int ans = 0;

    for(int i = start; i <= end; ++i) {
        if(find(a.begin(), a.end(), i) == a.end())
            continue;
        auto e1 = lower_bound(a.begin(), a.end(), i-1);
        auto e2 = upper_bound(a.begin(), a.end(), i+1);

 //       cout << *e2 << " " << *e1 << '\n';
        int temp = e2 - e1;
        ans = max(ans, (temp));
//        cout << i << " " << ans << "\n\n";
    }
    cout << ans << '\n';

    return 0;
}

Submission Info

Judge Result