2017年5月21日
POJ 2299 Ultra-QuickSort (树状数组+离散化 求逆序数)
摘要： In this problem, you have to analyze a particular sorting algorithm. The algorithm processes a sequence of n distinct integers by swapping two adjacen 阅读全文
posted @ 2017-05-21 10:22 抓不住Jerry的Tom 阅读(183) 评论(0) 推荐(0)