제출 #1029999

#제출 시각아이디문제언어결과실행 시간메모리
1029999Khanhcsp2Po (COCI21_po)C++14
20 / 70
8 ms1512 KiB
#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++) { while(!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(); } }
#Verdict Execution timeMemoryGrader output
Fetching results...