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
#include <bits/stdc++.h>
using namespace std;
#define rep(a, b) for (int a = 0; a < (b); a++)
#define rep1(a, b) for (int a = 1; a <= (b); a++)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int MOD = 1e9 + 7;

const int LIM = 1e6 + 7;
int n;

int nums[LIM];

int dp[LIM];
int dpr[LIM];
int nxt[LIM];

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    
    cin >> n;
    rep(i, n) cin >> nums[i];

    int cur = nums[0];
    int cnt = 1;
    dp[0] = 1;
    vector<pii> incr = {{0, nums[0]}};
    rep1(i, n-1) {
        if (nums[i] > cur) {
            cur = nums[i];
            cnt++;
            incr.push_back({i, nums[i]});
        }
    }
    int ans = cnt;

    vector<pii> stck;
    rep(i, n) {
        int cur = nums[i];
        while (!stck.empty()) {
            auto [idx, val] = stck.back();
            if (val < cur) {
                nxt[idx] = i;
                stck.pop_back();
            } else break;
        }
        stck.push_back({i, nums[i]});
    }
    for (int i = n-1; i >= 0; i--) {
        if (nxt[i] == 0) dpr[i] = 1;
        else dpr[i] = 1+dpr[nxt[i]];
    }

    int mx = -1;
    int start = 0;
    for (int i = n-1; i >= 0; i--) {
        mx = max(mx, nums[i]);
        if (!incr.empty() && incr.back().first == i) incr.pop_back();
        while (start < incr.size() && incr[start].second <= mx) start++;
        ans = max(ans, max(0, (int)incr.size()-start)+dpr[i]);
    }
    
    cout << ans << "\n";

    return 0;
}