제출 #782752

#제출 시각아이디문제언어결과실행 시간메모리
7827521075508020060209tcPo (COCI21_po)C++14
70 / 70
29 ms2464 KiB
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define X first
#define Y second
int n;
int ar[500005];

signed main(){
int ans=0;
cin>>n;
for(int i=1;i<=n;i++){
    cin>>ar[i];
}
stack<int>stk;
for(int i=1;i<=n;i++){
    while(stk.size()&&stk.top()>ar[i]){stk.pop();}
    if(stk.size()&&stk.top()==ar[i]){continue;}
    if(ar[i]==0){continue;}
    stk.push(ar[i]);
    ans++;
}
cout<<ans;

}
#Verdict Execution timeMemoryGrader output
Fetching results...