제출 #1232486

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1232486		Bahamin	Money (IZhO17_money)	C++20	0 / 100	0 ms	328 KiB

money

#include <bits/stdc++.h>

using namespace std;

template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { os << '{'; string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << '}'; }

#define ll long long
#define ld long double
#define all(a) (a).begin(), (a).end()
#define sui cout.tie(NULL); cin.tie(NULL); ios_base::sync_with_stdio(false)
const int MAX_N = 1e5 + 5;
const int MOD = 1e9 + 7;
const ll INF = 1e9;
const ld EPS = 1e-9;
const int LOG = 30;


void solve() {
    int n;
    cin >> n;
    int a[n];
    multiset<int> al;
    for (int i = 0; i < n; i++) cin >> a[i], al.insert(a[i]);
    int ans = 0;
    int ind = n - 1;
    while (ind >= 0)
    {
        ans++;
        int now = ind;
        while (ind >= 1)
        {
            bool ok = true;
            if (a[ind - 1] > a[ind]) ok = false;
            auto x = al.upper_bound(a[ind - 1]);
            if (x != al.end() && (*x) < a[ind]) ok = false;
            if (ok) ind--;
            else break;
        }   
        for (int j = ind; j <= now; j++) al.erase(al.find(a[j]));
        ind--;
    }
    cout << ans << "\n";
}

int main() {
    sui;
    int tc = 1;
    //cin >> tc;
    for (int t = 1; t <= tc; t++) {
        solve();
    }
}

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