摘要：
稳定排序就是相同元素排序后次序不会发生改变的排序方法.冒泡是稳定排序.快一点的归并也是稳定排序. 稳定排序Time Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2766Accepted Submission(s): 1081Problem Description大家都知道，快速排序是不稳定的排序方法。如果对于数组中出现的任意a[i],a[j](i<j),其中a[i]==a[j]，在进行排序以后a[i]一定出现在a[j]之前... 阅读全文
摘要：
思路很明确，直接用线段树.Balanced LineupTime Limit:5000MSMemory Limit:65536KTotal Submissions:26161Accepted:12250Case Time Limit:2000MSDescriptionFor the daily milking, Farmer John'sNcows (1 ≤N≤ 50,000) always line up in the same order. One day Farmer John decides to organize a game of Ultimate Frisbee with 阅读全文