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


constexpr int MAXN = 1e6 + 10;

using namespace std;

int n;

int a[MAXN];

//int dp[MAXN];

int main()
{
    cin >> n;

    for (int i = 1; i <= n; i++)
        cin >> a[i];

    int Y = n+1;

    int res = n + Y;

    if (n == 1)
    {
        cout << "3 1";

        return 0;
    }

    cout << res << ' ';

    int r = n;

    long long il = 0;

    int old_Y = Y;

    int old_il = 0;

    for (int l = 1; l <= r; l++)
    {
        il++;        

        //cout << l << ' ' << r << endl;

        while(a[r] <= Y/2 and l <= r)
        {
            r--;
            Y++;
            il++;

           // cout << l << ' ' << r << endl;
        }

        if (Y != old_Y)
            il--;


        //cout << il << ' ';

        if (a[l+1] - old_Y > Y)
            break;
        else
        {
            int q = max(a[l+1] - old_Y, 0);

            old_Y -= q;

            il = il + Y - old_Y;
        }

        //cout << il << endl;
    }

    cout << il;









         


    






    
}