1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
// Problem: Ranking sklepów internetowych [C]
// https://sio2.mimuw.edu.pl/c/pa-2021-1/p/ran/

#include <cstdio>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <string>
#include <cctype>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
using namespace std;
#define REP(i,n) for(int _n=(n), i=0;i<_n;++i)
#define FOR(i,a,b) for(int i=(a),_b=(b);i<=_b;++i)
#define FORD(i,a,b) for(int i=(a),_b=(b);i>=_b;--i)
#define FOREACH(e, v) for(auto const &e: v)
#define IN(e, s) (s).find((e)) != (s).end()
#define TRACE(x) cerr << "TRACE(" #x ")" << endl;
#define DEBUG(x) cerr << #x << " = " << (x) << endl;
#define PB push_back
#define ST first
#define ND second
#define ALL(c) (c).begin(), (c).end()
#define SZ(x) ((int)(x).size())
typedef long long LL; typedef unsigned long long ULL; typedef unsigned short UST; typedef unsigned int UINT;
typedef vector<int> VI;
inline  void fix_io() { cin.tie(nullptr); ios::sync_with_stdio(false); }

ULL target(double x, double y) {
    return x + 2 * y;
}

int main() {
    fix_io();
    UINT n;
    vector<UINT> v;
    unordered_map<ULL, ULL> m;
    cin >> n;
    FOR(i,1,n) {
        UINT ai;
        cin >> ai;
        v.PB(ai);
    }

    FOR(i,0,n-1) {
        FOR(j,0,n-1) {
            vector<UINT> tv;
            FOR(k,i,j) {
                tv.PB(v[k]);
            }
            sort(tv.begin(),tv.end());
            UINT n = tv.size();
            if (n == 0) continue;
            double median;
            if (n%2 == 0) {
                median = 0.5 * ((double)tv[(n-1)/2] + (double)tv[n/2]);
            } else {
                median = tv[n/2];
            }
            ULL t = target(tv.size(), median);
            // cout << "for i=" << i << ", j=" << j << " target=" << t << endl;
            m[t]++;
        }
    }

    ULL max = 0;
    ULL max_c = 0;

    for (auto x : m) {
        if (x.first > max) {
            max = x.first;
            max_c = x.second;
        }
    }

    cout << max << " " << max_c << '\n';
}