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
#include <iostream>
using namespace std;

const int MAXN = 1000000 + 7;
int tab[MAXN];

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int n; cin>>n;
	int l = 0, p = n - 1;
	for(int i = 0; i < n; i++)
	{
		cin>>tab[i];
	}
	// wszystkie i sam n
	int ile = n == 1 ? 1 : 2;
	int myMed = n + 1;
	int target = myMed + n;
	int len = n;
	while(len - 1 > 1)
	{
		//cout<<"rozpatrywany: "<<l<<' '<<p<<'\n';
		if(2 * tab[l] < myMed && myMed + 1 + (len - 1) == target)
		{
			ile++;
			//cout<<"dodano: "<<l + 1<<' '<<p<<'\n';
		}
		if(2 * tab[p] < myMed && myMed + 1 + (len - 1) == target)
		{
			ile++;
			//cout<<"dodano: "<<l<<' '<<p - 1<<'\n';
		}
		if(tab[p] < tab[l]) 
		{
			if(2 * tab[p] < myMed) myMed += 1;
			else if(2 * tab[p] > myMed) myMed -= 1;
			p--;
			len--;
		}
		else
		{
			if(2 * tab[l] < myMed) myMed += 1;
			else if(2 * tab[l] > myMed) myMed -= 1;
			l++;
			len--;
		}
	}
	cout<<2*n + 1<<' '<<ile<<'\n';
	return 0;
}