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
78
79
80
81
82
#include <bits/stdc++.h>

using namespace std;
using LL = long long;
#define FOR(i, l, r) for(int i = (l); i <= (r); ++i)
#define REP(i, n) FOR(i, 0, (n) - 1)
#define ssize(x) int(x.size())

template<class A, class B> auto &operator<<(ostream &o, pair<A, B> p) {
    return o << '(' << p.first << ", " << p.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 debug(x...) cerr << "[" #x "]: ", [](auto... $) {((cerr << $ << "; "), ...); }(x), cerr << '\n';
#else
#define debug(...) {}
#endif


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

    int n;
    cin >> n;
    vector<pair<int, int> > pos(n);
    REP(i, n) {
        int h;
        cin >> h;
        pos[i] = {h, i};
    }

    sort(pos.begin(), pos.end());
    vector<int> target(n), rev(n);
    REP(i, n) {
        target[pos[i].second] = i;
        rev[i] = pos[i].second;
    }

    vector<deque<int>> ans;
    while (true) {
        vector<bool> used(n);
        bool any_added = false;

        REP(i, n) {
            if (target[i] == i || used[i])
                continue;
            if (!any_added) {
                ans.push_back({});
                any_added = true;
            }
            int lft = i, rgt = target[i];
            while (!used[lft] && !used[rgt] && lft != rgt) {
                used[lft] = used[rgt] = true;
                ans.back().push_front(lft);
                ans.back().push_back(rgt);
                swap(target[lft], target[rgt]);
                rgt = target[lft];
                lft = rev[lft];
            }
            
        }

        if (!any_added)
            break;
    }

    cout << ssize(ans) << '\n';
    for (auto &que : ans) {
        cout << ssize(que) << '\n';
        for (auto &idx : que)
            cout << idx + 1 << ' ';
        cout << '\n';
    }

    return 0;
}