Key cutting

#include <bits/stdc++.h>

using namespace std;

int main()
{
    int n;
    cin >> n;
    vector<int> depth(n, 0);
    for(int i = 0; i < n;i++){
        cin >> depth[i];
    }

    stack<int> curr;
    curr.push(0);
    long long count = 0;

    for(int i = 0; i < n; i++){
        if(depth[i] > curr.top()){
            count++;
            curr.push(depth[i]);
        }else if(depth[i] == curr.top()){
            continue;
        }else if(depth[i] < curr.top()){
            curr.pop();
            
        }
    }
    cout << count << endl;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: WRONG ANSWER

Test 7

Verdict: WRONG ANSWER

Test 8

Verdict: WRONG ANSWER

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: WRONG ANSWER

Test 12

Verdict: WRONG ANSWER

Test 13

Verdict: WRONG ANSWER

Test 14

Verdict: WRONG ANSWER