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
#include<iostream>
#include<vector>
#include<list>
#include<algorithm>
using namespace std;

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n, maxx = 0, wyn = 0;
    cin >> n;
    vector<int> v(n);
    list<int> l;
    for (int i = 0; i < n; i++) {
        cin >> v[i];
        if (maxx < v[i]) l.push_back(i);
        maxx = max(maxx, v[i]);
    }
    wyn = max(wyn, int(l.size()));
    for (int i = n - 1; i >= 0; i--) {
        if (l.back() == i) l.pop_back();
        while (!l.empty() && v[l.front()] <= v[i]) l.pop_front();
        l.push_front(i);
        wyn = max(wyn, int(l.size()));
    }
    cout << wyn;
}