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

using namespace std;

#define st first
#define nd second
#define pb push_back
#define rep(i,a,b) for(int i = a; i <= b; i++)
#define irep(i,a,b) for(int i = a; i >= b; i--)
typedef long long ll;
typedef long double ld;
//typedef __int128 int128;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pi; 
typedef pair<double,double> pd;
typedef pair<ll,ll> pl;

const int max_n = 1e6+7;

int arr[max_n];
int dp_end[max_n];
int next_g[max_n];

int main(){

    ios::sync_with_stdio(0);
    cin.tie(0);

    //aha nie do konca lis tylko po prostu lca po wieksze kolejne xD
    //nie no to O(n)
    //po prostu gasienica xD
    //aha bo po prostu wartosc z prawego plus lewego xDDDD

    int n; cin >> n;
    rep(i,1,n) cin >> arr[i];

    irep(i,n,1){
        int ind = i+1;
        while(ind <= n && arr[ind] <= arr[i]) ind = next_g[ind];
        next_g[i] = ind;
        dp_end[i] = dp_end[ind]+1;
        //cout << "i: " << i << " dp: " << dp_end[i] << " next_g: " << next_g[i] << '\n';
    }
    //aha odwrocne xD
    //cout << "policzona 1 czesc"

    int ans = dp_end[1];

    int akt_m = 1;
    int l_ind = 1;
    irep(i,n,1){
        akt_m = max(akt_m,arr[i]);
        while(arr[l_ind] <= akt_m && l_ind < i) l_ind++;
        int val = dp_end[i];
        if(l_ind < i) val += dp_end[l_ind];
        ans = max(ans,val);
    }

    cout << ans;

    return 0;
}

//g++ -O3 -static -Wall .cpp -std=c++17