zoukankan      html  css  js  c++  java
  • CF 843 A. Sorting by Subsequences

    A. Sorting by Subsequences

    You are given a sequence a1, a2, ..., an consisting of different integers. It is required to split this sequence into the maximum number of subsequences such that after sorting integers in each of them in increasing order, the total sequence also will be sorted in increasing order.

    Sorting integers in a subsequence is a process such that the numbers included in a subsequence are ordered in increasing order, and the numbers which are not included in a subsequence don't change their places.

    Every element of the sequence must appear in exactly one subsequence.

    Input

    The first line of input data contains integer n (1 ≤ n ≤ 105) — the length of the sequence.

    The second line of input data contains n different integers a1, a2, ..., an ( - 109 ≤ ai ≤ 109) — the elements of the sequence. It is guaranteed that all elements of the sequence are distinct.

    Output

    In the first line print the maximum number of subsequences k, which the original sequence can be split into while fulfilling the requirements.

    In the next k lines print the description of subsequences in the following format: the number of elements in subsequence ci (0 < ci ≤ n), then ci integers l1, l2, ..., lci (1 ≤ lj ≤ n) — indices of these elements in the original sequence.

    Indices could be printed in any order. Every index from 1 to n must appear in output exactly once.

    If there are several possible answers, print any of them.

    Examples
    Input
    6
    3 2 1 6 5 4
    Output
    4
    2 1 3
    1 2
    2 4 6
    1 5
    Input
    6
    83 -75 -49 11 37 62
    Output
    1
    6 1 2 3 4 5 6
    Note

    In the first sample output:

    After sorting the first subsequence we will get sequence 1 2 3 6 5 4.

    Sorting the second subsequence changes nothing.

    After sorting the third subsequence we will get sequence 1 2 3 4 5 6.

    Sorting the last subsequence changes nothing.

    把每一次交换涉及到的元素放到一个集合中。

    #include <iostream>
    #include <algorithm>
    #include <cstring>
    #include <cstdio>
    #include <vector>
    #include <queue>
    #include <stack>
    #include <cstdlib>
    #include <iomanip>
    #include <cmath>
    #include <cassert>
    #include <ctime>
    #include <map>
    #include <set>
    using namespace std;
    #define lowbit(x) (x&(-x))
    #define max(x,y) (x>=y?x:y)
    #define min(x,y) (x<=y?x:y)
    #define MAX 100000000000000000
    #define MOD 1000000007
    #define pi acos(-1.0)
    #define ei exp(1)
    #define PI 3.141592653589793238462
    #define ios() ios::sync_with_stdio(false)
    #define INF 1044266558
    #define mem(a) (memset(a,0,sizeof(a)))
    typedef long long ll;
    int a[100005],b[100005],vis[100005];
    int ans,n;
    set<int>s;
    set<int>::iterator it;
    int main()
    {
        while(scanf("%d",&n)!=EOF)
        {
            fill(vis,vis+n,0);
            ans=0;
            for(int i=0;i<n;i++) scanf("%d",&a[i]),b[i]=a[i];
            sort(b,b+n);
            for(int i=0;i<n;i++) a[i]=lower_bound(b,b+n,a[i])-b;
            for(int i=0;i<n;i++)
            {
                if(!vis[i])
                {
                    for(int j=a[i];!vis[j];j=a[j]) vis[j]=1;
                    ans++;
                }
            }
            printf("%d
    ",ans);
            for(int i=0;i<n;i++)
            {
                if(vis[i])
                {
                    s.clear();
                    for(int j=a[i];vis[j];j=a[j]) s.insert(j+1),vis[j]=0;
                    int pos=s.size();
                    printf("%d",pos);
                    for(it=s.begin();it!=s.end();it++)
                        printf(" %d",*it);
                    printf("
    ");
                }
            }
        }
        return 0;
    }
  • 相关阅读:
    SQL语法:查询此表有另外一个表没有的数据
    .NET平台开源项目速览-最快的对象映射组件Tiny Mapper之项目实践
    win7 64 安装Oracle 11G 、使用PLSQL进行连接 标准实践
    json 筛选数据 $.grep过滤数据
    bootstrap table 行号 显示行号 添加行号 bootstrap-table 行号
    ajax 请求二进制流 图片 文件 XMLHttpRequest 请求并处理二进制流数据 之最佳实践
    JS中判断JSON数据是否存在某字段的方法 JavaScript中判断json中是否有某个字段
    json 数字key json 数字作为主键
    ajax 跨域 headers JavaScript ajax 跨域请求 +设置headers 实践
    扩展:gridview 空数据时显示表头
  • 原文地址:https://www.cnblogs.com/shinianhuanniyijuhaojiubujian/p/7447758.html
Copyright © 2011-2022 走看看