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
#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

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

  int n;
  cin >> n;
  vector<int> v(n);
  for(int& i : v) cin >> i;
  
  stack<pair<int, int>> st;
  st.push({1e9, -1});
  vector<int> vv = v;
  vector<int> l(2 * n);
  vv.insert(vv.end(), all(v));
  for(int i = 0; i < vv.size(); i++) {
    while(st.top().first < vv[i]) st.pop();
    l[i] = st.top().second;
    st.push({vv[i], i});
  }
  
  vector<int> res(n), cnt(n + 1);
  int tot = 0;
  for(int i = n - 1; i >= 0; i--) {
    tot -= cnt[i + 1];
    res[i] = tot;
    cnt[max(0, l[i])]++;
    tot++;
  }
  cnt.assign(n, 0);
  tot = 0;
  for(int i = 0; i < n; i++) {
    tot += cnt[i];
    if(l[i + n] < n) {
      cnt[l[i + n]]++;
      if(l[i + n] <= i) tot++;
    }
    res[i] += tot;
  }
  cout << *max_element(all(res)) << endl;
}