| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 366350 | CodePlatina | Po (COCI21_po) | C++14 | 12 ms | 1152 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 <iostream>
#include <vector>
#include <algorithm>
#include <utility>
#define pii pair<int, int>
#define piii pair<int, pii>
#define pll pair<long long, long long>
#define plll pair<long long, pll>
#define ff first
#define ss second
#define ee ss.ff
#define rr ss.ss
#define DEBUG
using namespace std;
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int n; cin >> n;
    int arr[n]; for(auto &i : arr) cin >> i;
    vector<int> Q{0};
    int ans = 0;
    for(int i = 0; i < n; ++i)
    {
        while(Q.size() && Q.back() > arr[i]) Q.pop_back(), ++ans;
        if(Q.empty() || Q.back() != arr[i]) Q.push_back(arr[i]);
    }
    cout << ans + (int)Q.size() - 1;
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
