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
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
// Wiktor Cupiał
// V LO Kraków
 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
 
#define mp make_pair
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define eb emplace_back
#define st first
#define nd second
#define vt vector
#define VAR(__var)  #__var << ": " << __var << " "
#define PAIR(__var) #__var << ": " << __var.first << ", " << __var.second << " "
#define FOR(__var, __start, __end)  for(int __var=__start; __var<__end; ++__var)
#define FORB(__var, __start, __end) for(int __var=__start; __var>__end; --__var)
#define maxi(__x, __y) __x = (__x>__y?__x:__y)
#define mini(__x, __y) __x = (__x<__y?__x:__y)
#define all(__var)     (__var).begin(),(__var).end()
#define rall(__var)    (__var).rbegin(),(__var).rend()
#define sz(__var)      (int)(__var).size()
#define satori         int __test; cin>>__test; while(__test--)
 
#ifndef DEBUG
#define DEBUG 0
#endif
#define debug if(DEBUG)
 
using namespace std;
 
using namespace __gnu_pbds;
template <typename T>
using ord_set = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
 
// templeos <3
typedef     int16_t i16;
typedef     int32_t i32;
typedef     int64_t i64;
typedef        void  u0;
typedef        bool  u1;
typedef        char  u8;
typedef    uint16_t u16;
typedef    uint32_t u32;
typedef    uint64_t u64;
typedef       float f32;
typedef      double f64;
typedef long double f86;
 
typedef       long long ll;
typedef     long double ld;
typedef   pair<ll, ll> pll;
typedef pair<int, int> pii;
 
const int INF = 1e9+2137;
 
int32_t main() {
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

	int n;
	cin >> n;

	vt<pii> a(n);
	FOR(i, 0, n)
		cin >> a[i].st, a[i].nd = i;

	sort(all(a), greater<pii>());
	int l = INF;
	int r = -1;
	ll res = 0;
	int target = -1, dl;

	auto licz = [&]() {
		int now = target-(dl-1);
		if(r-target+1 < 0)
			now += r-target+1;
		if(l+target-1 > n-1)
			now -= (l+target-1-(n-1));
		//cout << "target: " << target << '\n';
		//cout << l << ' ' << r << '\n';
		//cout << l+target-1 << ' ' << r-target+1 << ' ' << now << "\n\n";
		if(now > 0)
			res += now;

	};

	for(auto &[x, pos] : a) {
		++target;
		l = min(l, pos);
		r = max(r, pos);
		dl = r-l+1;

		if(dl <= target)
			licz();

		++target;
		if(dl <= target)
			licz();
	}

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

	return 0;
}