Submission #532090

#TimeUsernameProblemLanguageResultExecution timeMemory
532090kebineMoney (IZhO17_money)C++17
100 / 100
1004 ms51196 KiB
#include <bits/stdc++.h>

using namespace std;

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
    int n; cin >> n;
    int arr[n];
    int maxi = 1e9;
    set<int>s;

    for(int i = 0; i < n; i++) cin >> arr[i];

    int ans = 1;
    s.insert(arr[0]);

    for(int i = 1; i < n; i++){
        if(arr[i] < arr[i - 1] || arr[i] > maxi){
            ans++;
            auto tmp = s.upper_bound(arr[i]);
            if(tmp == s.end()) maxi = 1e9;
            else maxi = *tmp;
        }

        s.insert(arr[i]);
    }

    cout << ans << endl;

    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...