Poistot

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
 
typedef tree<int,null_type,less<>,rb_tree_tag,tree_order_statistics_node_update> index_set;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
 
#define F first
#define S second
#define PB push_back
#define EB emplace_back
#define FOR(i,a,b) for (int i = a; i < b; i++)
 
constexpr ll MOD = 1000000007;

map<ll, ll> km;

int main() {
    ios_base::sync_with_stdio(false); cin.tie(nullptr);
    ll n; cin >> n;
    ll ck = 0, mk = 0;
    set<pair<ll, ll>> r;
    FOR(i,0,n) {
        ll x; cin >> x;
        ll a = 1, b = mk;
        ll mid = -1;
        while (a <= b) {
            mid = (a + b) / 2;
            if (km[mid] >= x) a = mid + 1;
            else b = mid - 1;
        }
        if (mid == -1) ck = mk + 1;
        else ck = a;
        r.insert({ck, x});
        km[ck] = x;
        mk = max(ck, mk);
    }
    cout << mk << "\n";
    int pf = -1;
    for (pair i : r) {
        if (pf != -1 && pf != i.F) cout << "\n";
        cout << i.S << " ";
        pf = i.F;
    }
}

Test 1

Group: 1, 3

Verdict: ACCEPTED

Test 2

Group: 1, 2, 3

Verdict: ACCEPTED

Test 3

Group: 1, 3

Verdict: ACCEPTED

Test 4

Group: 1, 3

Verdict: ACCEPTED

Test 5

Group: 2, 3

Verdict: ACCEPTED

Test 6

Group: 2, 3

Verdict: ACCEPTED

Test 7

Group: 3

Verdict: ACCEPTED

Test 8

Group: 3

Verdict: ACCEPTED

Test 9

Group: 3

Verdict: ACCEPTED

Test 10

Group: 3

Verdict: ACCEPTED