Submission #331648

#	Time	Username	Problem	Language	Result	Execution time	Memory
331648		vitkishloh228	Money (IZhO17_money)	C++14	0 / 100	1 ms	364 KiB

money

#include<iostream>
#include<vector>
#include<algorithm>
#include<set>
using namespace std;
int main() {
    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;
}

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