Submission #765560

#TimeUsernameProblemLanguageResultExecution timeMemory
765560Ahmed57Money (IZhO17_money)C++17
0 / 100
1 ms296 KiB
#include<bits/stdc++.h>

using namespace std;

int main(){
    int n;
    cin>>n;
    long long arr[n+1];
    for(int i = 0;i<n;i++){
        cin>>arr[i];
    }
    arr[n] = 0;
    set<int> s;
    int ans = 0;
    auto it = s.end();
    for(int i = 1;i<=n;i++){
        s.insert(arr[i-1]);
        if(arr[i]<arr[i-1]||(it!=s.end()&&(*it)<arr[i])){
            ans++;
            it = s.lower_bound(arr[i]);
        }
    }
    cout<<ans<<endl;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...