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
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
#include <bits/stdc++.h>

using namespace std;

#define rep(i, n) for(int i = 0; i < n; i++)
#define pb push_back
#define debug(x) cout << #x << " " << x << endl
#define all(x) x.begin(),x.end()
#define ll long long
#define vi vector<int>
#define vvi vector<vi>
#define vvvi vector<vvi>
#define vll vector<ll>
#define vvll vector<vll>
#define ld long double
#define ull unsigned long long
#define vull vector<ull>
#define fi first
#define se second
#define PII pair<int,int>
#define vPII vector<PII>
#define getunique(v) {sort(v.begin(), v.end()); v.erase(unique(v.begin(), v.end()), v.end());}
#define int128 __int128

ll brut(vi a){
    int n = a.size();
    int ans = 2*n+1;
    ll cnt = 0;
    for(int i = 0; i < n; i++){
        for(int j = i; j < n; j++){
            ll ile = j-i+1;
            vi liczby;
            for(int k = i; k <= j; k++){
                liczby.pb(a[k]);
            }
            sort(all(liczby));
            ll med = 0;
            if(ile&1){
                med = 2*liczby[ile/2];
            }else{
                med = liczby[ile/2] + liczby[ile/2-1];
            }
            if(med + ile == ans) cnt++;
        }
    }
    return cnt;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
//    cout << setprecision(16) << fixed;
//    freopen("input.txt", "r", stdin);
//    freopen("output.txt", "w", stdout);
    int tt = 1;
//    cin >> tt;
    while(tt--) {
        int n; cin >> n;
        vi a(n), p(n), k(n);
        rep(i,n) cin >> a[i];
//        cout << brut(a) << "\n";
        p[0] = a[0];
        k[0] = a[n-1];
        for(int i = 1; i < n; i++){
            p[i] = max(a[i],p[i-1]);
            k[i] = max(k[i-1], a[n-i-1]);
        }
        ll ans = 0;
        for(int i = n; i >= 1; i--){
            ll us = n-i;
            int mini = n-i+1;
            int med = (mini + n)/2;
            ll ile = lower_bound(all(p),med) - p.begin();
            ll ile2 = lower_bound(all(k),med) - k.begin();
            ile = min(ile, us);
            ile2 = min(ile2,us);
            if(ile2 > ile) swap(ile,ile2);
            ll maks = ile;
            ll co = us - ile2;
            ans += max(0ll,maks-co+1);
        }
        cout << 2*n+1 << " " << ans;
//        if(brut(a) != ans){
//            cout << brut(a) << " " << ans << "\n";
//        }
    }
}