#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
template<typename T> using vc = vector<T>;
template<typename T> using vvc = vc<vc<T>>;
template<typename T> void smax(T& a, T b) {a = max(a, b);}
template<typename T> void smin(T& a, T b) {a = min(a, b);}
#define X first
#define Y second
#define pb push_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define read(a) for(auto& i : a) cin >> i
#define print(a) for(auto& i : a) cout << i << " "
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vc<int> a(n);
read(a);
int ans = n;
stack<int> s;
for(int i = 0; i < n; i++) {
while(!s.empty() && s.top() >= a[i]) {
if(s.top() == a[i]) ans--;
s.pop();
}
s.push(a[i]);
}
cout << ans;
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Incorrect |
1 ms |
312 KB |
Output isn't correct |
3 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
4 |
Incorrect |
5 ms |
588 KB |
Output isn't correct |
5 |
Incorrect |
6 ms |
728 KB |
Output isn't correct |
6 |
Correct |
11 ms |
1856 KB |
Output is correct |
7 |
Incorrect |
12 ms |
1596 KB |
Output isn't correct |