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
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#include <bits/stdc++.h>

using namespace std;

typedef uint32_t ul;
typedef int32_t l;
typedef uint64_t ull;
typedef int64_t ll;

const l INF = 1000000000 + 9;
const ll MOD = 123456789;
const l PRIME = 200003;
const ll L_INF = 1000000000000000000LL + 7;
const double EPS = 1e-5;

#define FOR(x, y, z) for (l z = x; z < y; z++)
#define FORE(x, y, z) for (l z = x; z <= y; z++)
#define FORD(x, y, z) for (l z = x; z > y; z--)
#define FORDE(x, y, z) for (l z = x; z >= y; z--)
#define REP(x, y) for (l y = 0; y < x; y++)
#define ALL(...) (__VA_ARGS__).begin(), (__VA_ARGS__).end()

#define PF push_front
#define POF pop_front
#define PB push_back
#define POB pop_back
#define MP make_pair
#define FS first
#define SC second

ll n, res = 0;
vector<pair<ll, ll> > reviews;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr); cout.tie(nullptr);

    cin >> n;
    REP(n, i)
    {
        l a;
        cin >> a;
        reviews.PB({a, i+1});
    }

    sort(ALL(reviews), greater<pair<l, l> >());
    ll mn=n+1, mks=0;
    FORE(1, (n+2)/2, i)
    {
        mn = min(mn, reviews[i-1].SC);
        mks = max(mks, reviews[i-1].SC);
        //cout << i << ": " << mn << " " << mks << "\n";

        ll total_len = 2*i-1, base_len = mks-mn+1;

        if(total_len < base_len)
            continue;

        if(total_len <= n)
        {
            ll start = max(1LL, mks-total_len+1LL);
            //cout << i << " (1) -> " << min(n-(start+total_len-1), mn-start)+1 << "\n";
            res += min(n-(start+total_len-1), mn-start)+1;
        }

        total_len = 2*i-2, base_len = mks-mn+1;

        if(total_len < base_len)
            continue;

        if(total_len <= n)
        {
            ll start = max(1LL, mks-total_len+1LL);
            //cout << i << " (2) -> " << min(n-(start+total_len-1), mn-start)+1 << "\n";
            res += min(n-(start+total_len-1), mn-start)+1;
        }
    }
    cout << 2*n+1 << " " << res << "\n";
}