Poistot

#include<bits/stdc++.h>
using namespace std;
#define N ((int)(2e5+5))

vector<vector<int>> result;

int main() {
    int n; 
    cin >> n;

    for(int i=0;i<n;++i) {
        int x;
        cin >> x;
        int l = 0, r = result.size()-1;
        while (l<r) {
            int mid = (l+r)/2;
            if (result[mid].back() >= x) l = mid+1;
            else r = mid;
        }
        if (result.size() && r>=0 && result[r].back() < x) result[r].push_back(x);
        else result.push_back({x});
    }
    cout << result.size() << '\n'; 
    for (auto &i : result) {
        for (int j : i) cout << j << ' '; 
        cout << '\n';
    }
}

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