POJ 2299 Ultra-QuickSort
摘要：
Ultra-QuickSortTime Limit:7000MSMemory Limit:65536KTotal Submissions:32539Accepted:11599DescriptionIn this problem, you have to analyze a particular sorting algorithm. The algorithm processes a sequence of n distinct integers by swapping two adjacent sequence elements until the sequence is sorted in 阅读全文
posted @ 2013-05-23 16:40 lzm风雨无阻 阅读(189) 评论(0) 推荐(0) 编辑
