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).
![](https://i-blog.csdnimg.cn/blog_migrate/a2a65a4e2b3790ef26cbc0df8ca655e0.jpeg)
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:
![](https://i-blog.csdnimg.cn/blog_migrate/d2e3312efbbd4e78d0314f54d44b0e1f.jpeg)
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)
题意就是根据给出的匹配 输出组合的情况。。感觉题意得根据样例理解啊 一开始看的时候都没什么思路。。
#include <cstdio>
#include <iostream>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <string.h>
#include <string>
#define eps 1e-8
#define op operator
#define MOD 10009
#define MAXN 100100
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define FOV(i,a,b) for(int i=a;i>=b;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define REV(i,a,b) for(int i=a-1;i>=b;i--)
#define MEM(a,x) memset(a,x,sizeof a)
#define ll __int64
using namespace std;
int a[100010];
int b[100010];
int vis[100010];
int main()
{
//freopen("ceshi.txt","r",stdin);
int n;
while(scanf("%d",&n)!=EOF)
{
MEM(vis,0);
for(int i=1;i<=n;i++)
{
scanf("%d",&a[i]);
b[a[i]]=i;
}
// for(int i=1;i<=n;i++)
// cout<<b[i]<<" ";
// cout<<endl;
for(int i=1;i<=n;i++)
{
if(!vis[i])
{
printf("(");
int num=0;
while(!vis[i])
{
if(num==0)
printf("%d",i);
else printf(" %d",i);
vis[i]=1;
// int x=a[i];
// cout<<"xxx "<<x<<endl;
// i=b[x];
i=a[i];
// cout<<"ii "<<i<<" "<<vis[i]<<endl;
num++;
}
printf(")");
}
}
puts("");
}
return 0;
}