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

using namespace std;
using LL = long long;
#define FOR(i, l, r) for(int i = (l); i <= (r); ++i)
#define REP(i, n) FOR(i, 0, (n) - 1)
#define ssize(x) int(x.size())

template<class A, class B> auto &operator<<(ostream &o, pair<A, B> p) {
    return o << '(' << p.first << ", " << p.second << ')';
}

template<class T> auto operator<<(ostream &o, T x) -> decltype(x.end(), o) {
    o << '{'; int i = 0; for (auto e : x) o << (", ")+2*!i++ << e;
    return o << '}';
}

#ifdef DEBUG
#define debug(x...) cerr << "[" #x "]: ", [](auto... $) {((cerr << $ << "; "), ...); }(x), cerr << '\n';
#else
#define debug(...) {}
#endif


constexpr int MAXVAL = 1'000'003;


struct Tree {
    int pwr = 1;
    vector<int> tree;

    Tree(int n) {
        while (pwr < n)
            pwr *= 2;
        tree.resize(pwr * 2);
    }

    void sub(int v, int x, int y, int l, int r) {
        if (y < l || x > r)
            return;
        if (x >= l && y <= r) {
            tree[v]--;
            return;
        }

        int mid = (x + y) / 2;
        sub(v * 2, x, mid, l, r);
        sub(v * 2 + 1, mid + 1, y, l, r);
    }

    void sub(int l, int r) {
        sub(1, 1, pwr, l, r);
    }

    int value(int x) {
        x += pwr - 1;
        int res = 0;
        while (x > 0) {
            res += tree[x];
            x /= 2;
        }
        return res;
    }
};


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

    int n;
    cin >> n;
    int m = 2 * n + 1;
    vector<int> a(m), dp(m);
    vector<int> lft(m), rgt(m);
    REP(i, n)
        cin >> a[i + n];

    a[n - 1] = MAXVAL;
    lft[n - 1] = n - 1;
    FOR(i, n, 2 * n - 1) {
        lft[i] = i - 1;
        while (a[lft[i]] < a[i])
            lft[i] = lft[lft[i]];
    }
    a[m - 1] = MAXVAL;
    rgt[m - 1] = 2 * n;
    for (int i = 2 * n - 1; i >= n; i--) {
        rgt[i] = i + 1;
        while (a[rgt[i]] <= a[i])
            rgt[i] = rgt[rgt[i]];
        dp[i] = dp[rgt[i]] + 1;
    }

    Tree tree(m);
    int ans = dp[n];
    FOR(t, 1, n - 1) {
        int i = n - t;
        int j = i + n;
        tree.sub(lft[j] + 1, j);
        a[i] = a[j];
        rgt[i] = i + 1;
        while (a[rgt[i]] <= a[i])
            rgt[i] = rgt[rgt[i]];

        dp[i] = dp[rgt[i]] + 1 + tree.value(rgt[i]);
        ans = max(ans, dp[i]);
    }

    cout << ans << '\n';

    return 0;
}