Submission #475153

#TimeUsernameProblemLanguageResultExecution timeMemory
475153Ahmed_SolymanPo (COCI21_po)C++14
20 / 70
46 ms1688 KiB
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

int main()
{
    ll n;cin>>n;
    ll arr[n];
    for(auto &i:arr)cin>>i;
    vector<ll>v;
    ll ans=0;
    for(ll i=0;i<n;i++){
        while(v.size() && v[v.size()-1]>arr[i]){
            v.pop_back();
        }
        if(!v.size())ans++;
        else if(v[v.size()-1]<arr[i])ans++;
        v.push_back(arr[i]);
    }
    cout<<ans<<endl;
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...