Poistot

#include <bits/stdc++.h> 
#define all(v) (v).begin(), (v).end()
using namespace std;
const int maxN = 2e5;
int t[4*maxN];
void update(int v, int tl, int tr, int pos, int val) {
	if (tl==tr) return void(t[v]=val);
	int tm = (tl+tr)/2;
	if (pos<=tm) update(v*2, tl, tm, pos, val);
	else update(v*2+1, tm+1, tr, pos, val);
	t[v] = max(t[v*2], t[v*2+1]);
}
int find_next(int v, int tl, int tr, int l, int r, int val) {
	if (tr<l || r<tl || t[v]<=val) return -1;
	if (tl==tr) return tl;
	int tm = (tl+tr)/2;
	int res = find_next(v*2, tl, tm, l, r, val);
	if (res!=-1) return res;
	return find_next(v*2+1, tm+1, tr, l, r, val);
}
int a[maxN];
int main() {
	int n;
	cin >> n;
	for (int i=0; i<n; i++) {
		cin >> a[i];
		update(1, 0, n-1, i, a[i]);
       	}
	vector<vector<int>> ans;
	while (true) {
		int i = find_next(1, 0, n-1, 0, n-1, 0);
		vector<int> cur;
		if (i==-1) break;
		while (i!=-1) {
			cur.push_back(a[i]);
			update(1, 0, n-1, i, 0);
			i = find_next(1, 0, n-1, i+1, n-1, a[i]);
		}
		ans.push_back(cur);
	}
	cout << ans.size() << '\n';
	for (auto &v: ans) {
		for (auto i: v) cout << i << ' ';
		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