Submission #644076

#	Time	Username	Problem	Language	Result	Execution time	Memory
644076		Alexandruabcde	Money (IZhO17_money)	C++14	100 / 100	952 ms	55844 KiB

money

#include <bits/stdc++.h>

using namespace std;

constexpr int NMAX = 1e6 + 5;

int N;
int A[NMAX];

set <int> S;

int main () {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    cin >> N;

    for (int i = 1; i <= N; ++ i )
        cin >> A[i];

    int ans = 0;

    for (int i = 1; i <= N; ++ i ) {
        ++ ans;

        auto it = S.upper_bound(A[i]);
        bool Up = 0;
        int TopCap = 0;

        if (it == S.end()) Up = true;
        else TopCap = *it;

        S.insert(A[i]);

        while (i < N && A[i+1] >= A[i] && (Up || A[i+1] <= TopCap) ) {
            S.insert(A[i+1]);
            ++ i;
        }
    }

    cout << ans << '\n';

    return 0;
}

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