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
#include <bits/stdc++.h>
using namespace std;
#define st first
#define nd second
#define iamspeed ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0)

long long n, t[1000006], ind[1000006], l, r, res = 1, odl, x, wiel;

int main()
{
    iamspeed;
    cin >> n;
    for(int i = 1 ; i <= n ; i++)
    {
        cin >> t[i];
        ind[t[i]] = i;
    }
    l = r = ind[n];
    for(int i = 2 ; i <= n ; i++)
    {
        if(i % 2 == 0)
        {
            l = min(ind[n - (i / 2)], l);
            r = max(ind[n - (i / 2)], r);
            odl = r - l + 1;
        }
        if(odl > i) continue;
        else
        {
            wiel = min(n, l + i - 1) - max(1LL, r - i + 1) + 1 - i + 1;
            res += wiel;
        }
    }
    cout << 2 * n + 1 << " " << res << endl;
}