oj.uz

Submission #1086162

# Submission time Handle Problem Language Result Execution time Memory
1086162 2024-09-09T16:22:28 Z duytuandao21 Po (COCI21_po) C++17
30 / 70
 8 ms 1028 KB 
#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++) {
		if (a[i] <= 0 && i > 1) continue;
        while (st.size() > 0 && a[i] < st.top()) st.pop();
        if (st.size() == 0 || st.top() != a[i]) 
        {
             res++;
             st.push(a[i]);
        }
    }
    cout << res;
    return 0;
}

Subtask #1
30.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Incorrect 4 ms 604 KB Output isn't correct
5 Incorrect 4 ms 604 KB Output isn't correct
6 Correct 8 ms 1028 KB Output is correct
7 Correct 7 ms 856 KB Output is correct