Submission #501929

#	Time	Username	Problem	Language	Result	Execution time	Memory
501929		SirCovidThe19th	Money (IZhO17_money)	C++17	100 / 100	1439 ms	53196 KiB

money

#include <bits/stdc++.h>
using namespace std; 

int n, ans = 1, A[1000005]; multiset<int> S;

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> n; 
    for (int i = 0; i < n; i++) cin >> A[i], S.insert(A[i]);

    S.erase(S.find(A[n - 1]));
    for (int l = n - 2, r = n - 1; ~l; l--){ //create new group at l?
        S.erase(S.find(A[l]));
        if (A[l] > A[l + 1]){ ans++, r = l; continue; }
        auto it = S.upper_bound(A[l]);

        if (A[l] > A[l + 1] or (it != S.end() and *it < A[r])) ans++, r = l;
    }
    cout<<ans<<"\n";
}

• Subtask 1: 9 / 9
• Subtask 2: 16 / 16
• Subtask 3: 20 / 20
• Subtask 4: 55 / 55