oj.uz

Submission #331648

# Submission time Handle Problem Language Result Execution time Memory
331648 2020-11-29T11:19:30 Z vitkishloh228 Money (IZhO17_money) C++14
0 / 100
 1 ms 364 KB 
#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.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -