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
// Karol Kosinski 2021
#include <bits/stdc++.h>
// #define ENABLE_DEBUG
#define FOR(i,a,b) for(int i=(a),_b=(b);i<_b;++i)
#define FR_(i,a,b) for(int i=(a),_b=(b);i<=_b;++i)
#define FD_(i,b,a) for(int i=(b),_a=(a);i>=_a;--i)
#define ALL(c) (c).begin(),(c).end()
#define SIZE(c) int((c).size())
#define TIE(x...) int x;tie(x)
#define X first
#define Y second
#ifndef ENABLE_DEBUG
#define DEB(k,f,x...)
#else
#define DEB(k,f,x...) {if(k)printf("--------%4d : %s\n",__LINE__,__FUNCTION__);f(x);}
#endif
#define DEBL DEB(1,void,0)
#define DEBF(f,x...) DEB(1,f,x)
#define DEBUG(x...) DEB(0,printf,x)
using namespace std;
using LL = long long;
using ULL = unsigned long long;
using PII = pair<int, int>;
using TIII = tuple<int, int, int>;

constexpr int NX = 1'000'003;

int A[NX], B[NX];

LL count(int n, int a)
{
    LL res = 0;
    int left = B[n], right = B[n], i = n - 1, j = a;
    while ( j <= n )
    {
        if ( B[i] < left ) left = B[i];
        else if ( right < B[i] ) right = B[i];
        int r = right - left;
        int z = j - r, u = 0;
        DEBUG("*** i = %d ,  j = %d ,  left = %d ,  right = %d ,  z = %d\n", i, j, left, right, z);
        if ( z > 0 )
        {
            int l_lim = left - ( z - 1 ), r_lim = right + ( z - 1 );
            if ( 1 > l_lim ) u += 1 - l_lim ;
            DEBUG("   --> u = %d\n", u);
            if ( r_lim > n ) u += r_lim - n;
            DEBUG("   --> u = %d\n", u);
            res += z - u;
        }
        j += 2;
        -- i;
    }
    DEBUG("%d -> %lld\n", a, res);
    return res;
}

int main()
{
    int n;
    scanf("%d", &n);
    FR_(i,1,n) scanf("%d", A + i);
    FR_(i,1,n) B[ A[i] ] = i;
    LL res = 1;
    res += count( n, 3 );
    res += count( n, 2 );
    printf("%d %lld\n", 2 * n + 1, res);
    return 0;
}