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
83
84
85
86
87
88
89
90
#include <bits/stdc++.h>
using namespace std;

#define REP(i, n) for (int i = 0; i < (int)n; i++)
#define ST first
#define ND second
#define MP make_pair
#define PB push_back

typedef vector<int> VI;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef set<int> SI;
typedef long long LL;

#ifdef DEBUG
const bool debug = true;
#else
const bool debug = false;
#endif

// #define MULTI_TASK true

const int INF = 1000 * 1000 * 1000;
const LL INFLL = 1e18;
const int MAKSN = 1000 * 1000 + 13;
const LL MOD = 123456789LL;
LL N, M, k, l, a, b, c, d;
vector<LL> v;
int pos[MAKSN], diff[MAKSN];

void zeruj() {
    v.clear();
}

void readIn() {
    cin >> N;
    REP(i, N) {
        cin >> k;
        v.push_back(k);
        pos[k] = i + 1;
    }
}

void solve() {
    LL ans = 1;
    int min_left = pos[N], max_right = pos[N];
    int nums = 1, ile_randow = 0, ile_nierandow = 1;

    for (int i = N - 1; i > 0; i--) {
        nums++;
        if (nums % 2 == 0) {
            min_left = min(min_left, pos[N - ile_nierandow]);
            max_right = max(max_right, pos[N - ile_nierandow]);
            ile_nierandow++;
        } else {
            ile_randow++;
        }
        int mamy = max_right - min_left + 1;

        if (mamy > nums)
            continue;

        int z_lewej = min_left - 1;
        int z_prawej = N - max_right;
        int brak = nums - mamy;
        int max_wys = min(brak, max(z_lewej, z_prawej));
        int ile_przes = min(brak, min(z_lewej, z_prawej) - (brak - max_wys));

        ans += (ile_przes + 1);
    }

    cout << 2 * N + 1 << " " << ans << "\n";
}

int main() {
    ios_base::sync_with_stdio(0);
#ifdef MULTI_TASK
    int test;
    cin >> test;
    while (test--) {
#endif
        zeruj();
        readIn();
        solve();
#ifdef MULTI_TASK
    }
#endif
    return 0;
}