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
#include <cstdio>
#include <vector>
#include <algorithm>
#include <cmath>

using namespace std;

int main() {
  int n; scanf("%d", &n);
  vector<int> a(n*2);
  for (int i=0; i<n; i++) {
    scanf("%d", &a[i]);
    a[i+n] = a[i];
  }

  int best = 0;
  vector<int> stack;

  for (int i=n*2-1; i>=0; --i) {
    while (!stack.empty() && a[i] >= stack.back()) stack.pop_back();
    stack.push_back(a[i]);
    if (stack.size() > best) best = stack.size();
  }

  printf("%d\n", best);
  return 0;
}