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
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
#include <bits/stdc++.h>
using namespace std;

#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x)                                                                    \
    sim > typename enable_if<sizeof dud<c>(0) x 1, debug &>::type operator<<(c i) \
    {
sim > struct rge
{
    c b, e;
};
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c *x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug
{
#ifdef XOX
    ~debug()
    {
        cerr << endl;
    }
    eni(!=) cerr << boolalpha << i;
    ris;
} eni(==) ris << range(begin(i), end(i));
}
sim, class b dor(pair<b, c> d)
{
    ris << "" << d.first << " --> " << d.second << "";
}
sim dor(rge<c> d)
{
    *this << "[";
    for (auto it = d.b; it != d.e; ++it)
        *this << ", " + 2 * (it == d.b) << *it;
    ris << "]";
}
#else
    sim dor(const c &)
    {
        ris;
    }
#endif
}
;

#define imie(...) "" << #__VA_ARGS__ " = " << (__VA_ARGS__) << ", "
#define pb push_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define f first
#define s second

#define sz(x) (x).size()
#define all(x) (x).begin(), (x).end()
#define vt vector

using ll = long long;
using pi = pair<int, int>;
using pll = pair<ll, ll>;

using vi = vt<int>;
using vvi = vt<vi>;
using vll = vt<ll>;
using vvll = vt<vll>;
using vs = vt<string>;
using vpi = vt<pi>;
using vvpi = vt<vpi>;
using vpll = vt<pll>;
using vvpll = vt<vpll>;

const int mod = 1e9 + 7;
const int nax = 1e6 + 9;
int a[nax];
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie();
    int n;
    cin >> n;
    vpi v(n);
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i];
        v[i - 1] = {a[i], i};
    }
    int tofind = n * 2 + 1;
    ll cnt = 0;
    sort(all(v));
    reverse(all(v));
    int l = 1e9;
    int r = 0;
    int x, y, length;
    for (pi i : v)
    {
        l = min(l, i.s);
        r = max(r, i.s);
        x = l - 1;
        y = n - r;
        if (x > y)
            swap(x, y);
        length = tofind - 2 * i.f;
        if (length >= (r - l + 1) && length <= n)
        {
            length -= (r - l + 1);
            if (y >= length)
                cnt += min(length + 1, x + 1);
            else
                cnt += max(0, x + y - length + 1);
        }
        length = tofind - (i.f + i.f + 1);
        if (length >= (r - l + 1) && length <= n)
        {
            length -= (r - l + 1);
            if (y >= length)
                cnt += min(length + 1, x + 1);
            else
                cnt += max(0, x + y - length + 1);
        }
    }
    cout << tofind << " " << cnt;
}