Magic__

Minimum Inversion NumberTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5180    Accepted Submission(s): 3173Problem DescriptionThe i

敌兵布阵Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 20735    Accepted Submission(s): 9099Problem DescriptionC国的死对头A国这段时间正在进行军事演习，所以C

StarsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 23114 Accepted: 10077DescriptionAstronomers often examine star maps where stars are represented by po

乾坤大挪移            时间限制: 1000 ms　内存限制: 65535 K                  问题描述                给定一个n，代表有1~n个数，然后给定这n个数的一个序列，可以进行的操作是不断交换相邻的两个数字，使得最后的结果是一个上升序列。例如1 3 2，交换2和3，就能得到1 2 3,即为所求的序列，此时只交换了一步，所以输出1.