1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
#include <bits/stdc++.h>
using namespace std;template<class A,class B>auto&operator<<(ostream&o,pair<A,B>
x){return o<<'('<<x.first<<' '<<x.second<<')';}template<class T>auto operator<<(
ostream&o,T x)->decltype(x.end(),o){o<<'{';int i=0;for(auto e:x)o<<(", ")+2*!i++
<<e;return o<<'}';}
#ifdef DEBUG
#define LOG(x...)cerr<<"["#x"]: ",[](auto...$){((cerr<<$<<"; "),...)<<'\n';}(x)
#else
#define LOG(x...)
#endif

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);

	int size;
	cin >> size;

	vector<pair<int, int>> values(size);

	for (int index = 0; index < size; index++) {
		cin >> values[index].first;
		values[index].second = index;
	}

	sort(values.begin(), values.end());

	vector<int> normalized(size);

	for (int index = 0; index < size; index++)
		normalized[values[index].second] = index;
	
	LOG(normalized);
	vector<vector<int>> results;

	while (true) {
		vector<pair<int, int>> swaps;
		vector<bool> dirty(size);

		for (int index = 0; index < size; index	++) {
			if (normalized[index] == index)
				continue;

			if (dirty[normalized[index]] || dirty[index])
				continue;

			swaps.push_back({ index, normalized[index] });
			dirty[normalized[index]] = true;
			dirty[index] = true;

			swap(normalized[index], normalized[normalized[index]]);
		}

		if (swaps.empty())
			break;

		results.push_back({});

		for (int index = 0; index < swaps.size(); index++)
			results.back().push_back(swaps[index].first);

		for (int index = swaps.size() - 1; index >= 0; index--)
			results.back().push_back(swaps[index].second);
	}

	cout << results.size() << '\n';

	for (auto &result : results) {
		cout << result.size() << '\n';

		for (auto value : result)
			cout << value + 1 << ' ';

		cout << '\n';
	}
}