#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5 + 7;
int n, a[N];
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for(int i = 1; i <= n; i++)
cin >> a[i];
int res = 0;
stack<int> st;
st.push(0);
for(int i = 1; i <= n; i++){
while (a[st.top()] > a[i]){
st.pop();
res++;
}
if (a[st.top()] < a[i])
st.push(i);
}
res += st.size() - 1;
cout << res;
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
364 KB |
Output is correct |
2 |
Correct |
1 ms |
364 KB |
Output is correct |
3 |
Correct |
1 ms |
364 KB |
Output is correct |
4 |
Correct |
6 ms |
492 KB |
Output is correct |
5 |
Correct |
7 ms |
620 KB |
Output is correct |
6 |
Correct |
13 ms |
876 KB |
Output is correct |
7 |
Correct |
12 ms |
748 KB |
Output is correct |