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
#include <bits/stdc++.h>
#pragma GCC target ("avx2,fma")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")

#define ll long long
#define ld long double
#define endl '\n'
#define st first
#define nd second
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define FOR(i,l,r) for(int i=(l);i<=(r);i++)
#define ROF(i,r,l) for(int i=(r);i>=(l);i--)
using namespace std;
int inf=1000000007;
ll infl=1000000000000000007;
const ll mod=1000000007;

#ifdef LOCAL
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif

const int N=1000007;

int BIT[N];
int QUE(int x)
{
	int s=0;
	for(;x>0;x-=x&-x) s+=BIT[x];
	return s;
}
int que(int l,int r)
{
	return QUE(r)-QUE(l-1);
}
void ins(int x,int s)
{
	for(;x<N;x+=x&-x) BIT[x]+=s;
}

int a[N];
int S[N],mx[N];

signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n;
    cin>>n;
    FOR(i,1,n) cin>>a[i];
    a[n+1]=inf;
    deque<int>Q={n+1};
    ROF(i,n,1)
    {
		mx[i]=max(a[i],mx[i+1]);
		while(a[Q.back()]<=a[i]) Q.pop_back();
		Q.pb(i);
		S[i]=sz(Q)-1;
	}
	int ans=0,t=0,X=0;
	FOR(i,1,n)
	{
		ans=max(ans,S[i]+que(mx[i]+1,N-1));
		if(a[i]>X)
		{
			t++;
			X=a[i];
			ins(a[i],1);
		}
	}
	ans=max(ans,t);
	cout<<ans<<endl;
    
    return 0;
}