| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 386430 | phathnv | Po (COCI21_po) | C++11 | 13 ms | 876 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5 + 7;
int n, a[N];
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin >> n;
    for(int i = 1; i <= n; i++)
        cin >> a[i];
    int res = 0;
    stack<int> st;
    st.push(0);
    for(int i = 1; i <= n; i++){
        while (a[st.top()] > a[i]){
            st.pop();
            res++;
        }
        if (a[st.top()] < a[i])
            st.push(i);
    }
    res += st.size() - 1;
    cout << res;
    return 0;
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
