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

using namespace std;
#define vec vector
vec<int> tree;
int M = 1;
int qery(int x) {
  int res = 0;
  x += M;
  while (x > 1) {
    res += tree[x];
    x /= 2;
  }
  return res;
}

void updt(int l, int r) {
  l += M;
  r += M;
  if (l != r) tree[r] ++;
  tree[l] ++ ;
  while (l / 2 != r / 2) {
    if (l % 2 == 0) tree[l + 1] ++;
    if (r % 2 == 1) tree[r - 1] ++;
    r /= 2;
    l /= 2;
  }
}

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int n; cin >> n;
  vec<int> a(n);
  for (int i = 0; i < n; i++) cin >> a[i];
  
  vec<pair<int, int>> stk;
  vec<int> prevsm(n, -1);
  for (int i = 0; i < n; i++) {
    while (!stk.empty() and stk.back().first < a[i]) {
      stk.pop_back();
    }
    if (!stk.empty()) prevsm[i] = stk.back().second;
    stk.push_back({a[i], i});
  }

  stk.clear();
  for (int i = 0; i < n; i++) {
    while (!stk.empty() and stk.back().first < a[i]) {
      stk.pop_back();
    }

    stk.push_back({a[i], i});
  }

  reverse(stk.begin(), stk.end());
  vec<int> newstk;
  for (auto [el, _]: stk) newstk.push_back(el);
  M = 1;
  while (M < n) M *= 2;
  tree.assign(2 * M, 0);

  for (int i = 0; i < n; i++) {
    if (prevsm[i] != -1) {
      updt(min(prevsm[i] + 1, n - 1), i);
    } else {
      updt(0, i);

      auto it = lower_bound(newstk.begin(), newstk.end(), a[i]);
      if (it != newstk.end()) {
        if (stk[it - newstk.begin()].second + 1 >= n) continue;
        updt(stk[it - newstk.begin()].second + 1, n - 1);
      }
    }
  }
  int maxi = 0;
  for (int i = 0; i < n; i++) {
    maxi = max(maxi, qery(i));
  }
  cout << maxi;
}