# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
782751 | 2023-07-14T08:57:24 Z | 1075508020060209tc | Po (COCI21_po) | C++14 | 0 ms | 0 KB |
#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; }