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
#include <bits/stdc++.h>
using namespace std;

int a[1000001];
long long wyn;

int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	
	int n;
	cin >> n;
	
	for(int i = 0; i < n; ++i)
	{
		int x;
		cin >> x;
		a[x] = i;
	}
	
	int maxp = 0, minp = n;
	for(int i = 1; i <= n; ++i)
	{
		maxp = max(maxp, a[n-i/2]);
		minp = min(minp, a[n-i/2]);
		
		int mins = max(0, maxp-i+1);
		int maxs = min(minp, n-1-i+1);
		wyn += max(0, maxs-mins+1);
		
		//cout << i << " " << max(0, maxs-mins+1) << "\n";
	}
	
	cout << (n<<1)+1 << " " << wyn;
	
	return 0;
}