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
#if defined(EMBE_DEBUG) && !defined(NDEBUG)
#include "embe-debug.hpp"
#else
#define LOG_INDENT(...) do {} while (false)
#define LOG(...) do {} while (false)
#define DUMP(...) do {} while (false)
#endif

#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;

namespace {

int count(int len, int l, int r, int n)
{
  int res = 0;
  int l1 = max(0, r - len + 1);
  int l2 = min(l, n - len);
  if (l1 <= l2) res += l2 - l1 + 1;
  return res;
}

pair<int, long long> solve(vector<int> const& data)
{
  int n = data.size();
  long long res = 0;
  vector<int> pos(n + 1);
  for (int i = 0; i < n; ++i) {
    pos[data[i]] = i;
  }
  int r = -1;
  int l = n;
  for (int y2 = 2 * n; y2 > n; --y2) {
    int x = 2 * n + 1 - y2;
    int q = y2 / 2;
    l = min(l, pos[q]);
    r = max(r, pos[q]);
    res += count(x, l, r, n);
  }
  return {2 * n + 1, res};
}

}

int main()
{
  iostream::sync_with_stdio(false);
  cin.tie(nullptr);

  int n;
  cin >> n;

  vector<int> data(n);
  for (auto& x: data) cin >> x;

  auto res = solve(data);
  cout << res.first << ' ' << res.second << endl;

  return 0;
}