hdoj4985Little Pony and Permutation

Little Pony and Permutation

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

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)
  
  

 

Source

BestCoder Round #7

 

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>
#include<list>
#include<vector>
using namespace std;
const int maxn=100010;
int p[maxn];
bool vis[maxn];
int ans[maxn],cnt;
void dfs(int n,int e){
    vis[n]=true;
    if(n==e)return ;
    ans[cnt++]=n;
    dfs(p[n],e);
}
int main()
{
    int t,i,j,k,n;
    while(scanf("%d",&n)!=EOF){
        for(i=1;i<=n;++i){
            scanf("%d",&k);
            p[i]=k;
        }
        memset(vis,false,sizeof(vis));
        for(i=1;i<=n;++i){
            if(!vis[i]){
                cnt=0;
                ans[cnt++]=i;
                dfs(p[i],i);
                printf("(");
                for(j=0;j<cnt;++j){
                    if(j==cnt-1){
                        printf("%d)",ans[j]);
                    }
                    else printf("%d ",ans[j]);
                }
            }
        }
        printf("\n");
    }
    return 0;
}