- Category:
- CSharp
- Tags:
-
[C/C++]
[源码]
- File Size:
- 7kb
- Update:
- 2013-03-31
- Downloads:
- 0 Times
- Uploaded by:
- 何安
Description: N test tubes of varying lengths in a laboratory. Your task is to write a program, with a robotic arm from small to large order according to height. For the relative position of the same height before and after the test tube, sort should remain unchanged. Sorting method shown in Fig. Sorting requires n times of operation, wherein the i-th operation is the reversed sequence I ~~ Pi, where Pi is the i-th test tube current location of the target state. For instance, In the figure, the initial P1 = 4, therefore inverted test tube 1 to 4 will be able to put the most left of the tube homing. Similarly, before the second operation P2 = 6, therefore inverted 2 to 6 can be the number of the left two tubes homing. Your task is the output P1, P2, ..., PN value of, in order to control the robotic arm moves. Note that i = Pi actually does not need to be reversed, but still need to output Pi. [Input Format] input consists of multiple sets of test data. Each test tubes the number n (1 ≤ n ≤ 100000), t
To Search:
File list (Check if you may need any files):
机器排序\sort.cpp
........\机器排序.doc
机器排序
Download