hdu 4985 Little Pony and Permutation（水题）

Little Pony and Permutation

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 640    Accepted Submission(s): 343

Problem Description

As a unicorn, the ability of using magic is the distinguishing feature among other kind of pony. Being familiar with composition and decomposition is the fundamental course for a young unicorn. Twilight Sparkle is interested in the decomposition of permutations. A permutation of a set S = {1, 2, ..., n} is a bijection from S to itself. In the great magician —— Cauchy's two-line notation, one lists the elements of set S in the first row, and then for each element, writes its image under the permutation below it in the second row. For instance, a permutation of set {1, 2, 3, 4, 5} σ can be written as:


Here σ(1) = 2, σ(2) = 5, σ(3) = 4, σ(4) = 3, and σ(5) = 1.
Twilight Sparkle is going to decompose the permutation into some disjoint cycles. For instance, the above permutation can be rewritten as:


Help Twilight Sparkle find the  lexicographic smallest solution. (Only considering numbers).

 

Input

Input contains multiple test cases (less than 10). For each test case, the first line contains one number n (1<=n<=10^5). The second line contains n numbers which the i-th of them(start from 1) is σ(i).

 

Output

For each case, output the corresponding result.

 

Sample Input

  
  

   
   5
2 5 4 3 1
3
1 2 3
  
  

 

Sample Output

  
  

   
   (1 2 5)(3 4)
(1)(2)(3)
  
  

题意：1 2 3 4 5和他所给的一个打乱的序列比，求所有循环序列，按照字典序输出

比如1 2 3 4 5

       2 5 4 3 1

（1 2 5）（3 4）分别是两个循环序列

思路：直接模拟即可

代码：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
#define N 100050
int a[N],b[N];
int vis[N];
int main()
{
    int n;
    for(int i=1;i<N;i++)
        a[i]=i;
    while(~scanf("%d",&n))
    {
        memset(vis,0,sizeof(vis));
        for(int i=1;i<=n;i++)
        scanf("%d",&b[i]);
        for(int i=1;i<=n;i++)
        {
            if(vis[i]) continue;
            int k=b[i];
            printf("(%d",i);
            while(k!=i)
            {
                vis[k]=1;
                printf(" %d",k);
                int l=a[k];
                k=b[l];
            }
            printf(")");
        }
        printf("\n");
    }
    return 0;
}