----分块
文章平均质量分 82
_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 · 1279 阅读 · 1 评论 -
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 · 614 阅读 · 0 评论 -
HDU 5860 Death Sequence
Problem DescriptionYou may heard of the Joseph Problem, the story comes from a Jewish historian living in 1st century. He and his 40 comrade soldiers were trapped in a cave, the exit of which was原创 2016-08-24 14:44:19 · 467 阅读 · 0 评论