Submission #331651

#TimeUsernameProblemLanguageResultExecution timeMemory
331651vitkishloh228Money (IZhO17_money)C++14
100 / 100
1449 ms56428 KiB
#include<iostream>
#include<vector>
#include<algorithm>
#include<set>
using namespace std;
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int n;
    cin >> n;
    vector<int> a(n);
    for (int i = 0; i < n; ++i) cin >> a[i];
    vector<int> q = a;
    sort(q.begin(), q.end());
    set<int> s;
    int cnt = 1;
    int last = 1e9;
    s.insert(1e9);
    for (int i = 0; i < n; ++i) {
        if (i == 0) {
            
          //  last = a[i];
        }
        else if (a[i] < a[i-1] || a[i]>last) {
            cnt++;
            last = *s.upper_bound(a[i]);
        }
        s.insert(a[i]);
    }
    cout << cnt;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...