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
#include <bits/stdc++.h>

using namespace std;

#define MAX_N 1000007

using ll = long long;

int n;
ll toRes;
ll t[MAX_N], pos[MAX_N];
int b, e, fend, lend;
int length, it;

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> t[i];
    pos[t[i]] = i;
  }

  it = n;
  b = pos[n]; e = pos[n];
  for (int i = n; i >= 1; i--) {
    length++;
    if ((n - i + 1) % 2 == 0) {
      it--;
      if (b > pos[it]) b = pos[it];
      if (e < pos[it]) e = pos[it];
    }
    fend = max(length, e);
    lend = min(n, b + length - 1);
    toRes += max((ll)0, (ll)(lend - fend + 1));
  }
  cout << 2 * n  +1 << " " << toRes;
}