Po (COCI)

#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
using namespace std;
const int N = 1e5;
int a[N+1], ans[N+1], n;
void read()
{
   cin >> n;
   for (int i = 1; i <= n; ++ i)
   {
       cin >> a[i];
   }
}
void solve()
{
    vector<int> sol;
    ans[0] = 0;
    for (int i = 1; i <= n; ++ i)
    {
        ans[i] = ans[i-1];
        if (a[i] == 0)
        {
            sol.clear();
            continue;
        }
        else
        {
            while (!sol.empty() && a[sol.back()] > a[i])
            {
                sol.pop_back();
            }
            if (sol.empty() || a[sol.back()] < a[i])
            {
                sol.push_back(i);
                ++ans[i];
            }
        }
    }
    cout << ans[n];
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    read();
    solve();
}