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
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
#define FOR(i, l, r) for(int i = (l); i <= (r); ++i)
#define REP(i, n) FOR(i, 0, (n) - 1)
#define ssize(x) int(x.size())
template<class A, class B> auto& operator<<(ostream &o, pair<A, B> p) {
    return o << '(' << p.first << ", " << p.second << ')';
}
template<class T> auto operator<<(ostream &o, T x) -> decltype(x.end(), o) {
    o << '{'; int i = 0; for(auto e : x) o << (", ")+2*!i++ << e; return o << '}';
}
#ifdef DEBUG
#define debug(x...) cerr << "[" #x "]: ", [](auto... $) {((cerr << $ << "; "), ...); }(x), cerr << '\n'
#else
#define debug(...) {}
#endif

int main() {
    cin.tie(0)->sync_with_stdio(0);

    int n;
    cin >> n;

    vector<int> where(n);
    REP(i, n) {
        int a;
        cin >> a;
        where[a - 1] = i;
    }
  
    int l = n, r = 0;
    LL cnt = 0;
    for(int i = n - 1; i >= 0; i--) {
        l = min(l, where[i]);
        r = max(r, where[i]);
        int ele = n - i;
        cnt += max(0, - max(0, r - (ele - 1) * 2) + min(l, n - ele * 2 + 1) + 1);
        if(ele > 1) cnt += max(0, - max(0, r - (ele - 1) * 2 + 1) + min(l, n - ele * 2 + 2) + 1);
    }

    cout << 2 * n + 1 << " " << cnt << "\n";
}