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

const int MAXN = 1e6+6;
int t[MAXN], dlug[MAXN], najw[MAXN];
deque<int> mono;

int main(){
    ios_base::sync_with_stdio(0);
    int n; cin >> n;
    for(int i=1;i<=n;i++) cin >> t[i];
    for(int i=n;i>0;i--){
        while(!mono.empty() && t[i] >= mono.back()) mono.pop_back();
        mono.push_back(t[i]);
        dlug[i] = mono.size();
        najw[i] = max(najw[i+1],t[i]);
    }
    mono.clear();
    int ans=0;
    for(int i=1;i<=n;i++){
        int bin_search = mono.size() - (upper_bound(mono.begin(),mono.end(),najw[i]) - mono.begin());
        ans = max(ans, dlug[i] + bin_search);
        if(mono.empty() || mono.back() < t[i]) mono.push_back(t[i]);
    }
    cout << ans;
}