Codeforces AIM Tech Round 4 (Div. 2) C Sorting by Subsequences (dfs)

最新推荐文章于 2022-07-13 02:01:45 发布

m0_37802215

最新推荐文章于 2022-07-13 02:01:45 发布

阅读量635

点赞数

分类专栏： acm 暑假 codeforces 学习经历文章标签： codeforces dfs c语言 acm

本文链接：https://blog.csdn.net/m0_37802215/article/details/77547025

版权

acm 同时被 3 个专栏收录

87 篇文章 0 订阅

订阅专栏

学习经历

37 篇文章 0 订阅

订阅专栏

暑假

32 篇文章 0 订阅

订阅专栏

也不算dfs吧,因为每一个数只能出现一次,所以他必要找到”下家”才行,也就是他该在的位置,那么这是一个连锁的反应.

/*  xzppp  */
#include <iostream>
#include <vector>
#include <cstdio>
#include <string.h>
#include <algorithm>
#include <queue>
#include <map>
#include <math.h>
#include <string>
using namespace std;
#define FFF freopen("in.txt","r",stdin);freopen("out.txt","w",stdout);
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define MP make_pair
#define PB push_back
typedef long long  LL;
typedef unsigned long long ULL;
const int MAXN = 1e5+17;
const int MAXM = 20;
const int INF = 0x7fffffff;
const int MOD = 1e9+7;
int a[MAXN],b[MAXN],vis[MAXN];
map<int,int > mp;
vector<int > ans[MAXN];
void dfs(int plc,vector<int > & v)
{
    //cout<<plc<<endl;
    v.push_back(plc);
    vis[plc]=1;
    if(!vis[mp[a[plc]]])
    dfs(mp[a[plc]],v);
}
int main()
{
    #ifndef ONLINE_JUDGE 
    FFF
    #endif
    int n;
    cin>>n;
    for (int i = 1; i <= n; ++i)
    {
        scanf("%d",&a[i]);
        b[i] = a[i];
    }
    sort(b+1, b+n+1);
    for (int i = 1; i <= n; ++i)
    {
        mp[b[i]] = i;
    }
    int x= 0;
    for (int i = 1; i <= n; ++i)
    {
        if(!vis[i])
        {
            dfs(i,ans[x++]);
        }
    }
    cout<<x<<endl;
    for (int i = 0; i < x; ++i)
    {
        printf("%d ",ans[i].size() );
        for (int j = 0; j < ans[i].size(); ++j)
            {
                printf("%d%c",ans[i][j],j==ans[i].size()-1?'\n':' ');
            }
    }
    return 0;
}