
----treap
文章平均质量分 83
_Occult_
物語が始まった
展开
-
HDU 5618 Jam's problem again
Problem DescriptionJam like to solve the problem which on the 3D-axis,given N(1≤N≤100000) points (x,y,z)(1≤x,y,z≤100000)If two point such as (xi,yi,zi) and (xj,yj,zj) xi≥xj yi≥yj zi≥zj, the原创 2016-02-01 22:20:23 · 1323 阅读 · 1 评论 -
ZOJ 2112 Dynamic Rankings
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 number of the given N numbers. They have developed原创 2015-08-03 21:51:06 · 665 阅读 · 0 评论 -
CodeForces 19D Points
DescriptionPete and Bob invented a new interesting game. Bob takes a sheet of paper and locates a Cartesian coordinate system on it as follows: point (0, 0) is located in the bottom-left corner, O原创 2016-04-01 21:58:16 · 607 阅读 · 0 评论 -
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 ab原创 2016-02-13 15:32:41 · 643 阅读 · 0 评论