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
#include <iostream>
#include <set>

using namespace std;

int main()
{
	int n;
	cin >> n;
	
	int grades[n];
	int maxi = -1;
	for (int i = 0; i < n; ++i)
	{
		cin >> grades[i];
		if (grades[i] == n)
			maxi = i;
	}

	set<int> median;
	int possible = 0;
	
	for (int i = 0; i <= maxi; ++i)
		median.insert(grades[i]);

	for (int i = 0; i <= maxi; ++i)
	{
		for (int j = maxi; j < n; ++j)
		{
			median.insert(grades[j]);
			if (median.size() % 2)
			{
				auto l = median.end();
				--l;
				for (int a = 0; a < median.size() / 2; ++a)
					--l;

				if (*l * 2 + (j - i + 1) == 2 * n + 1)
					possible++;
			}
			else
			{
				auto l = median.end();
				auto r = median.end();
				--l;
				for (int a = 0; a < median.size() / 2; ++a)
				{
					--l; --r;
				}

				if (*l + *r + (j - i + 1) == 2 * n + 1)
					possible++;
			}
		}
		for (int j = maxi; j < n; ++j)
			median.erase(grades[j]);

		median.erase(grades[i]);
	}

	cout << 2 * n + 1 << " " << possible << "\n";
	return 0;
}