# |
제출 시각 |
아이디 |
문제 |
언어 |
결과 |
실행 시간 |
메모리 |
540548 |
2022-03-20T22:24:42 Z |
glome |
Po (COCI21_po) |
C++17 |
|
10 ms |
980 KB |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> y(n);
for (int i = 0; i<n; i++) {
cin >> y[i];
}
stack<int> q;
q.push(-1);
int ans = -1;
for (int i = 0; i<n; i++) {
while(q.top() > y[i]) {
ans++;
q.pop();
}
if(y[i] != q.top()) q.push(y[i]);
}
cout << ans + q.size() << '\n';
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
3 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
4 |
Incorrect |
4 ms |
596 KB |
Output isn't correct |
5 |
Incorrect |
5 ms |
724 KB |
Output isn't correct |
6 |
Correct |
10 ms |
980 KB |
Output is correct |
7 |
Incorrect |
9 ms |
852 KB |
Output isn't correct |