Blocks

#include <bits/stdc++.h>
using namespace std;
typedef long long unsigned ll;

int main()
{
    vector<vector<ll>> staks;
    ll n;
    cin >> n;

    deque<ll> blocks;

    for (ll i = 0; i< n ; i++) {
        ll x;
        cin >> x;
        blocks.push_back(x);
    }

    while (!blocks.empty()) {
        ll x = blocks.front();
        blocks.pop_front();
        //cout << x << endl;

        ll min_index = INT_MAX;
        ll min_value = INT_MAX;
        for (ll i = 0; i < staks.size() ; ++i) {
            auto& s = staks[i];
            if (s.back() > x) {
                if (s.back() - x < min_value) {
                    min_index = i;
                    min_value = s.back() - x;
                }
            }
        }

        if (min_index != INT_MAX) {
            // found a possible stack
            staks[min_index].push_back(x);
        } else {
            staks.push_back(vector<ll>());
            staks.back().push_back(x); // add a new stack
        }


    }

    /*
    for (auto& s : staks) {
        for (auto val : s) {
            cout << val << ", ";
        }
        cout << endl;
    }

    cout << endl; */

    cout << staks.size() << endl;
    // greetings to sharph
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED

Test 19

Verdict: ACCEPTED

Test 20

Verdict: ACCEPTED

Test 21

Verdict: ACCEPTED

Test 22

Verdict: ACCEPTED

Test 23

Verdict: ACCEPTED

Test 24

Verdict: ACCEPTED

Test 25

Verdict: ACCEPTED

Test 26

Verdict: ACCEPTED

Test 27

Verdict: ACCEPTED

Test 28

Verdict: ACCEPTED

Test 29

Verdict: ACCEPTED

Test 30

Verdict: ACCEPTED