Submission #1086167

#TimeUsernameProblemLanguageResultExecution timeMemory
1086167duytuandao21Po (COCI21_po)C++17
70 / 70
9 ms860 KiB
#include<bits/stdc++.h> using namespace std; const int N = 2e5 + 7; const int inf = 1e9 + 7; const long long infll = 1e18 + 7; int n; int a[N], posMin[N], prePos[N]; pair<int, int> b[N]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n; for (int i = 1; i <= n; i++) cin >> a[i]; stack <int> st; int res = 0; for (int i = 1; i <= n; i++) { while (st.size() > 0 && a[i] < st.top()) st.pop(); if (st.size() == 0 || st.top() != a[i]) { if (a[i] > 0)res++; st.push(a[i]); } } cout << res; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...