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
/*
	Zadanie: Ranking sklepów internetowych
	Autor: Tomasz Kwiatkowski
*/

#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back

using namespace std;
typedef long long ll;

const int MAXN = 1000*1000 + 7;
const int INF = 1000*1000*1000 + 7;

int good(int minn, int maxx, int d, int n)
{
	if (d > n)
		return 0;

	int left = max(0, maxx - d + 1);
	int right = min(n - 1, minn + d - 1);
	return max(0, right - left + 2 - d);
}

int main()
{
	ios_base::sync_with_stdio(0), cin.tie(0);

	int n;
	cin >> n;
	vector<pair<int, int>> rating(n);
	for (int i = 0; i < n; ++i) {
		cin >> rating[i].fi;
		rating[i].se = i;
	}
	sort(rating.rbegin(), rating.rend());

	ll ans = 0;
	int minn = n;
	int maxx = -1;
	int d = 0;
	for (auto [val, ind] : rating) {
		minn = min(ind, minn);
		maxx = max(ind, maxx);

		ans += good(minn, maxx, d, n);
		ans += good(minn, maxx, d + 1, n);
		d += 2;
		if (d > n)
			break;
	}
	cout << 2*n + 1 << ' ' << ans << '\n';
	return 0;
}