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
81
82
//   _|                                                _|
//   _|  _|    _|    _|    _|_|    _|_|_|      _|_|_|  _|  _|      _|_|      _|_|
//   _|_|      _|    _|  _|_|_|_|  _|    _|  _|_|      _|_|      _|_|_|_|  _|_|_|_|
//   _|  _|    _|    _|  _|        _|    _|      _|_|  _|  _|    _|        _|
//   _|    _|    _|_|_|    _|_|_|  _|_|_|    _|_|_|    _|    _|    _|_|_|    _|_|_|
//                   _|            _|
//               _|_|              _|
#include <iostream>

using namespace std;

// #define DEBUG
#ifdef DEBUG
#define dassert(x) assert(x);
#define df(...) printf(__VA_ARGS__)
#else
#define dassert(x)
#define df(...)
#endif

#define x first
#define y second
#define mp make_pair
#define pb push_back
#define ir(x, a, b) ((a) <= (x) && (x) <= (b))
#define vec vector
#define sz(x) (ll)x.size()
#define foru(i, n) for (int i = 0; (i) < (n); ++(i))
#define all(x) (x).begin(), (x).end()

typedef long long ll;
typedef pair<ll, ll> pll;

int read() {
    int n = 0; bool b = 0; char c = getchar();
    for (; !ir(c, '0', '9'); c = getchar()) b = (c == '-');
    for (; ir(c, '0', '9'); c = getchar()) n = 10*n + (c-'0');
    if (b) return -n;
    return n;
}

const int N = 1e6+10;
int n;
ll a[N], idx[N];

int main() {
    df("debug mode\n");
#ifndef DEBUG
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#endif
    cin >> n;
    foru (i, n) cin >> a[i];
    foru (i, n) idx[a[i]] = i;
    // always possible for [idx[n], idx[n]]
    ll s = 0;
    ll l, r;
    l = r = idx[n];
    for (int i = n; i >= 1; --i) {
        l = min(l, idx[i]);
        r = max(r, idx[i]);
        int len = r-l+1, tops = n-i+1;
        df("[%d, %d] len: %d\t tops:%d\n", l, r, len, tops);
        if (ir(2*tops-2, 1, n)) {
            ll x = 2*tops-2;
            int bl = max(r-x+1, ll(0));
            int br = min(n-x, l);
            df("%d %d %d\n", x, bl, br);
            s += max(br-bl+1, 0);
        }
        df("[half after %d] s: %d\n", i, s);
        if (ir(2*tops-1, 1, n)) {
            ll x = 2*tops-1;
            int bl = max(r-x+1, ll(0));
            int br = min(n-x, l);
            df("%d %d %d\n", x, bl, br);
            s += max(br-bl+1, 0);
        }
        df("[after %d] s: %d\n\n", i, s);
    }
    cout << 2 * n + 1 << " " << s << "\n";
    return 0;
}