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
#include <bits/stdc++.h>
#include <random>
#define ll long long int
#define pb push_back
#define st first
#define nd second
#define pii pair<int,int>
#define mp make_pair
#define pll pair<long long,long long>
#define ld long double
#define ull unsigned long long

using namespace std;

const int nax = 1e6 + 5;
int a[nax];
int n;
int pos[nax];


void solve(){
    cin >> n;
    for(int i=1;i<=n;i++) cin >> a[i];
    int res = n + n + 1;
    for(int i=1;i<=n;i++) pos[a[i]] = i;
    ll ways = 1;
    int w1 = 0;
    int w2 = n + 1;
    for(int usun=1;usun<n;usun++){
        int smaller = (n + 1 + usun) / 2;
        while(a[w1 + 1] < smaller) w1 += 1;
        while(a[w2 - 1] < smaller) w2 -= 1;
        int pr = w1;
        int sf = n - w2 + 1;

        int x1 = pr;
        int x2 = sf;
        int L = usun - x1;
        int H = usun;

        L = max(L, 0);

        int st = max(L, 0);
        int ent = min(H, x2);
        ways += max(ent - st + 1, 0);

    }
    cout << res << " " << ways << "\n";

}

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

    int tt = 1;
    // cin >> tt;
    while(tt--) solve();

    return 0;
}