|
||||||||||
Little Pony and PermutationTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 920 Accepted Submission(s): 486 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
Sample Output
Source | ||||||||||
|