Description There are N cities in a country, and
there is one and only one simple path between each pair of cities. A merchant
has chosen some paths a...
分类：
其他好文 时间：
2014-04-30 17:09:30
阅读次数：
570
时间限制:10000ms
单点时限:1000ms
内存限制:256MB
Description
Find a pair in an integer array that swapping them would maximally decrease the inversion count of the array. If such a pair exists, retur...
分类：
其他好文 时间：
2014-04-27 17:48:35
阅读次数：
508
