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

#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define all(x) begin(x), end(x)
#define sz(x) int((x).size())
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;

#ifdef LOCAL
auto operator<<(auto& o, auto x) -> decltype(x.first, o);
auto operator<<(auto& o, auto x) -> decltype(x.end(), o) {
  o << "{";
  for (int i = 0; auto y : x) o << ", " + !i++ * 2 << y;
  return o << "}"; }
auto operator<<(auto& o, auto x) -> decltype(x.first, o) {
  return o << "(" << x.first << ", " << x.second << ")"; }
void __print(auto... x) { ((cerr << x << " "), ...) << endl; }
#define debug(x...) __print("[" #x "]:", x)
#else
#define debug(...) 2137
#endif

const int N = 1000100;
int n;
int a[2 * N];

int main() {
  cin.tie(0)->sync_with_stdio(0);
  cin >> n;
  rep(i, 0, n) cin >> a[i];
  rep(i, 0, n) a[n + i] = a[i];
  deque<int> q;
  for (int i = 2 * n - 1; i >= n; i--) {
    while (sz(q) && a[q.front()] <= a[i]) q.pop_front();
    q.push_front(i);
  }
  int odp = 0;
  for (int i = n - 1; i >= 0; i--) {
    while (q.back() >= i + n) q.pop_back();
    while (sz(q) && a[q.front()] <= a[i]) q.pop_front();
    q.push_front(i);
    odp = max(odp, sz(q));
  }
  cout << odp << '\n';
}