2013年7月31日
POJ 2104 K-th Number（划分树）
摘要： DescriptionYou are working for Macrohard company in data structures department. After failing your previous task about key insertion you were asked to write a new data structure that would be able to return quickly k-th order statistics in the array segment.That is, given an array a[1...n] of differ 阅读全文
posted @ 2013-07-31 17:45 Oyking 阅读(366) 评论(0) 推荐(0)