2012年8月11日
poj 2299 Ultra-QuickSort(求逆序数，树状数组)
摘要： Ultra-QuickSortTime Limit: 7000MSMemory Limit: 65536KTotal Submissions: 27736Accepted: 9946DescriptionIn 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 阅读全文
posted @ 2012-08-11 20:31 剑不飞 阅读(176) 评论(0) 推荐(0)