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
#include <iostream>

using namespace std;

#define ll long long int

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

    ll n;
    cin >> n;

    ll* whereToFind = new ll[n]();
    ll a;

    for (ll i = 0; i < n; i++)
    {
        cin >> a;
        whereToFind[a - 1] = i;
    }

    ll left = whereToFind[n - 1];
    ll right = whereToFind[n - 1];
    ll largestNotInRange = n - 2;

    ll totalCount = 0;
    for (ll i = 0; i < n; i++)
    {
        if (i % 2 == 1)
        {
            ll stretch = whereToFind[largestNotInRange];

            if (stretch < left)
                left = stretch;
            if (stretch > right)
                right = stretch;

            largestNotInRange--;
        }

        ll desiredLength = i + 1;
        ll currentLength = right - left + 1;

        if (currentLength <= desiredLength)
        {
            ll toStretch = desiredLength - currentLength;

            ll leftSpace = min(left, toStretch);
            ll rightSpace = min(n - right - 1, toStretch);

            ll addage = leftSpace + rightSpace - toStretch + 1;

            if (addage > 0)
            {
                totalCount += addage;
            }
        }
    }

    cout << n * 2 + 1 << ' ' << totalCount << '\n';

}