#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> arr(2*n);
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
copy(arr.begin(), arr.begin() + n, arr.begin() + n);
int res = 0;
stack<int> order;
reverse(arr.begin(), arr.end());
for (int v : arr) {
while (!order.empty() && order.top() <= v) {
order.pop();
}
order.push(v);
res = max(res, (int) order.size());
}
cout << res << "\n";
}
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 | #include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); int n; cin >> n; vector<int> arr(2*n); for (int i = 0; i < n; i++) { cin >> arr[i]; } copy(arr.begin(), arr.begin() + n, arr.begin() + n); int res = 0; stack<int> order; reverse(arr.begin(), arr.end()); for (int v : arr) { while (!order.empty() && order.top() <= v) { order.pop(); } order.push(v); res = max(res, (int) order.size()); } cout << res << "\n"; } |
English