2019年7月6日
zoj 2112 or bzoj1901 分析动态区间第k大的几种解法。
摘要： The Company Dynamic Rankings has developed a new kind of computer that is no longer satisfied with the query like to simply find the k-th smallest num 阅读全文
posted @ 2019-07-06 21:20 zjxxcn 阅读(284) 评论(0) 推荐(0) 编辑