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
#include <bits/stdc++.h>
using namespace std;

bool cmp(pair <int, int> A, pair <int, int> B)
{
    return A.first > B.first;
}

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

    int a;
    cin >> a;

    pair <int, int> tab[a];

    for(int i = 0; i < a; i++)
    {
        cin >> tab[i].first;

        tab[i].second = i;
    }

    sort(tab, tab + a, cmp);

    int mini = tab[0].second;
    int maxi = tab[0].second;

    cout << (2 * a) + 1 << " ";

    long long ile = 0;

    for(int i = 1; i <= a; i++)
    {
        if(i % 2 == 0)
        {
            maxi = max(maxi, tab[i / 2].second);
            mini = min(mini, tab[i / 2].second);
        }

        if(maxi - mini + 1 <= i)
        {
            ile += min(min(i - (maxi - mini), a - i + 1), min(mini + 1, a - maxi));
        }
    }

    cout << ile << endl;

    return 0;
}