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
#pragma GCC optimize ("Ofast")
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define FOR(i, a, b) for (auto i=(a); i<(b); i++)
#define FORD(i, a,  b) for (auto i=(a); i>(b); i--)
#define SZ(x) ((int)(x).size())
#define ITH_BIT(m, i) ((m)>>(i) & 1)
#define PPC(x) __builtin_popcount(x)

#ifdef DEBUG
#include "debug.h"
#else
#define dbg(...) 0
#endif
template <typename T1, typename T2> inline void remin(T1& a, T2 b) { a = std::min(a, (T1)b);	}
template <typename T1, typename T2> inline void remax(T1& a, T2 b) { a = std::max(a, (T1)b);	}

const int maxN = 1 << 20, INF = 1 << 20;

int T[maxN];
int sufMax[maxN], sufProfit[maxN];

void solve()
{
	int n;
	scanf ("%d", &n);
	FOR(i, 0, n)
		scanf ("%d", T+i);
	
	std::stack <int> S;
	S.push(INF);

	FORD(i, n-1, -1)
	{
		sufMax[i] = std::max(sufMax[i+1], T[i]);
		while (S.top() <= T[i])
			S.pop();
		sufProfit[i] = SZ(S);
		S.push(T[i]);
	}

	int res = 0;
	std::vector <int> P(1, 0);

	FOR(i, 0, n)
	{
		if (P.back() < T[i])
			P.push_back(T[i]);
		int border = sufMax[i+1];
		auto visibStart = std::ranges::upper_bound(P, border);
		int prefProfit = P.end() - visibStart;

		remax(res, prefProfit + sufProfit[i+1]);
	}
	printf("%d\n", res);
}

int main()
{
	int tc = 1;
//	scanf ("%d", &tc);

	FOR(cid, 1, tc+1)
	{
//		printf("Case #%d: ", cid);
		solve();
	}
	return 0;
}