Submission #50327370

---

Source Code Expand

/**
 _  _   __  _ _ _  _  _ _
 |a  ||t  ||o    d | |o  |
| __    _| | _ | __|  _ |
| __ |/_  | __  /__\ / _\|

**/

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;



int main () {
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int n, k;
    cin >> n >> k;
    int a[n];
    map <int, int> occ;
    int max_occ = 0;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        max_occ = max(max_occ, ++occ[a[i]]);
    }
    vector <int> v;
    for (pair <int, int> p : occ) {
        if (p.second == max_occ) {
            v.push_back(p.first);
        }
    }
    ll answer = v.front() - v.back() + (ll) (n - max_occ) * k;
    int max_diff = 0;
    for (int i = 0; i + 1 < (int) v.size(); i++) {
        max_diff = max(max_diff, v[i + 1] - v[i]);
    }
    answer = max(answer, max_diff + (ll) (n - max_occ - 1) * k);
    cout << answer << "\n";

    return 0;
}

Submission Info

Judge Result