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
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<unordered_map>

using namespace std;

typedef vector<int> VI;
typedef long long LL;

#define FOR(x, b, e) for(int x=b; x<=(e); ++x)
#define FORD(x, b, e) for(int x=b; x>=(e); --x)
#define REP(x, n) for(int x=0; x<(n); ++x)
#define VAR(v, n) __typeof(n) v = (n)
#define ALL(c) (c).begin(), (c).end()
#define SIZE(x) ((int)(x).size())
#define FOREACH(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define PB push_back
#define ST first
#define ND second

int main() {
	ios_base::sync_with_stdio(0);
    int n;
    cin >> n;
    VI a(n);
    VI ind(n + 1);
    REP(i, n) {
        cin >> a[i];
        ind[a[i]] = i;
    }

    int l = ind[n], r = ind[n];
    LL res = 0;
    int len = 0;
    for(int i = n; len <= n; i--) {
        l = min(l, ind[i]);
        r = max(r, ind[i]);
        if(r - l + 1 <= len) {
            int diff = len - (r - l + 1);
            int li = max(0, l - diff);
            int ri = min(n - 1, r + diff);
            res += (ri - li + 1) - len + 1;
        }
        len++;
        if(r - l + 1 <= len) {
            int diff = len - (r - l + 1);
            int li = max(0, l - diff);
            int ri = min(n - 1, r + diff);
            res += (ri - li + 1) - len + 1;
        }
        len++;
    }
    cout << (2 * a.size() + 1) << ' ' << res << '\n';

    return 0;
}