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
#include <iostream>
#include <vector>
#include <deque>

using namespace std;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n;
    cin >> n;
    vector<int> a(n);
    deque<int> maxs;

    for (int i = 0; i < n; i++) {
        cin >> a[i];
        if (maxs.empty() || a[i] > maxs.back()) {
            maxs.push_back(a[i]);
        }
    }

    int maxSize = maxs.size();
    for (int i = n - 1; i >= 0; i--) {
        while (!maxs.empty() && a[i] >= maxs.front()) {
            maxs.pop_front();
        }
        maxs.push_front(a[i]);
        if (maxs.size() > maxSize) {
            maxSize = maxs.size();
        }
    }

    cout << maxSize << endl;
}