#include <bits/stdc++.h>
using namespace std;
int main() {
int N, D; cin >> N >> D;
vector<int> a(N); for(int &b : a) cin >> b;
reverse(a.begin(), a.end());
stack<int> s;
int mx = 0;
for(int i = 0; i < N; ++i) {
while(!s.empty() && a[i] >= s.top()) s.pop();
s.push(a[i]);
mx = max(mx, (int)s.size());
}
cout << mx << "\n";
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |