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
#ifdef LOC
#include "debuglib.hpp"
#else
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define deb(...)
#define DBP(...)
#endif
using namespace std;
using   ll         = long long;
using   vi         = vector<int>;
using   pii        = pair<int, int>;
#define pb           push_back
#define mp           make_pair
#define x            first
#define y            second
#define rep(i, b, e) for (int i = (b); i < (e); i++)
#define each(a, x)   for (auto& a : (x))
#define all(x)       (x).begin(), (x).end()
#define sz(x)        int((x).size())

int main() {
	cin.sync_with_stdio(0); cin.tie(0);

	int n; cin >> n;
	vi a(n);
	each(e, a) cin >> e;

	deque<int> que;
	int ans = 0;

	rep(t, 0, 2) {
		for (int i = n-1; i >= 0; i--) {
			if (!que.empty() && que.back() == i) {
				que.pop_back();
			}
			while (!que.empty() && a[i] >= a[que.front()]) {
				que.pop_front();
			}
			que.push_front(i);
			ans = max(ans, sz(que));
		}
	}

	cout << ans << '\n';
}