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
// Patryk Jędrzejczak

#include <bits/stdc++.h>

using namespace std;

#define REP(i, n) for(int i = 0; i < n; ++i)
#define REPR(i, n) for(int i = n - 1; i >= 0; --i)
#define FOR(i, a, b) for(int i = a; i < b; ++i)
#define FORR(i, a, b) for(int i = b - 1; i >= a; --i)
#define EB emplace_back
#define MP make_pair
#define ST first
#define ND second
#define S size
#define RS resize
#define endl '\n'
#define L long long

template<class T> using V = vector<T>;

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);

  int n;
  cin >> n;

  V<int> a(n);
  V<int> p(n + 1);
  REP(i, n) {
    cin >> a[i];
    p[a[i]] = i;
  }

  int l = p[n], r = p[n];
  L res = 1;
  int d = 1;
  FORR(v, 1, n) {
    l = min(l, p[v]);
    r = max(r, p[v]);
    d++;
    //cout << "v: " << v << " l: " << l << " r: " << r << " d: " << d << " res: " << res << '\n';
    if (d <= n && r - l + 1 <= d) {
      int lk = max(0, r - d + 1);
      int rk = min(n - 1, l + d - 1);
      res += (L)(rk - lk - d + 2);
    }
    d++;
    //cout << "v: " << v << " l: " << l << " r: " << r << " d: " << d << " res: " << res << '\n';
    if (d <= n && r - l + 1 <= d) {
      int lk = max(0, r - d + 1);
      int rk = min(n - 1, l + d - 1);
      res += (L)(rk - lk - d + 2);
    }
  }

  cout << 2 * n + 1 << ' ' << res;
}