#include<bits/stdc++.h>
#define el '\n'
#define fi first
#define sc second
#define int ll
#define pii pair<int, int>
#define all(v) v.begin(), v.end()
using namespace std;
using ll=long long;
using ull=unsigned long long;
using ld=long double;
const int mod=1e9+7;
const int N=2e5+11;
stack<int> s;
int n, a[N];
void sol()
{
cin >> n;
for(int i=1;i<=n;i++) cin >> a[i];
int ans=0;
for(int i=1;i<=n;i++)
{
if(!s.empty() && s.top()>a[i]) s.pop();
if(s.empty() || s.top()!=a[i]) ans++, s.push(a[i]);
}
cout << ans;
}
signed main()
{
// freopen("divisor.INP", "r", stdin);
// freopen("divisor.OUT", "w", stdout);
ios_base::sync_with_stdio(0);
cin.tie(0);
int t=1;
//cin >> t;
while(t--)
{
sol();
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Incorrect |
0 ms |
460 KB |
Output isn't correct |
3 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
4 |
Incorrect |
3 ms |
1136 KB |
Output isn't correct |
5 |
Incorrect |
5 ms |
1388 KB |
Output isn't correct |
6 |
Correct |
10 ms |
2476 KB |
Output is correct |
7 |
Incorrect |
12 ms |
2140 KB |
Output isn't correct |