Submission #676317

#TimeUsernameProblemLanguageResultExecution timeMemory
676317stevancvMoney (IZhO17_money)C++14
100 / 100
897 ms58148 KiB
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define sp ' '
#define en '\n'
#define smin(a, b) a = min(a, b)
#define smax(a, b) a = max(a, b)
using namespace std;
const int N = 1e6 + 2;
const ll linf = 1e18;
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n; cin >> n;
    vector<int> a(n);
    for (int i = 0; i < n; i++) cin >> a[i];
    multiset<int> s;
    int ans = 0;
    for (int i = 0; i < n; i++) {
        auto it = s.upper_bound(a[i]);
        int j = i;
        while (j < n - 1 && a[j] <= a[j + 1] && (it == s.end() || *it >= a[j + 1])) j++;
        for (int k = i; k <= j; k++) s.insert(a[k]);
        ans++;
        i = j;
    }
    cout << ans << en;
    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...