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
80
#include <iostream>                                                             
#include <vector>                                                               
#include <algorithm>      
#include <math.h>

using namespace std;

int main()
{
    ios_base::sync_with_stdio(0);
    long n;

    cin >> n;
    vector<long> arr(n);

    for (long i = 0; i < n; i++)
    {

        cin >> arr[i];
    }

    long max = 0;
    long numElements = 0;


    for (size_t i = 0; i < n; i++)
    {
        long count = 0;
        long value = 0;
        vector<long> tempArr = arr;
        for (size_t j = i; j < n; j++)
        {
            if (i == j)
            {
                value = 2 * tempArr[i] + 1;
            }
            else
            {
                int k = j;

                while (k > i)
                {
                    if (tempArr[k] < tempArr[k - 1])
                    {
                        // swap
                        long temp = tempArr[k];
                        tempArr[k] = tempArr[k - 1];
                        tempArr[k - 1] = temp;
                    }
                    k--;
                }
                const long length = j - i + 1;
                if (length % 2 == 0)
                {
                    value = length + tempArr[i + length / 2] + tempArr[i + length/ 2 - 1];
                }
                else
                {
                    value = length + 2 * tempArr[(i + j) / 2];
                }
            }

            if (value > max)
            {
                max = value;
                count = 1;
            }
            else if (value == max)
            {
                count++;
            }
        }
        numElements += count;
    }

    cout << max << " " << numElements << "\n";


    return 0;
}