码迷,mamicode.com
首页 >  
搜索关键字:integer to roman    ( 15811个结果
【微软2014实习生及秋令营技术类职位在线测试】题目3 : Reduce inversion count
时间限制: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
15811条   上一页 1 ... 1580 1581 1582
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!