2014年11月2日
HDU5087——Revenge of LIS II(BestCoder Round #16)
摘要： Revenge of LIS IIProblem DescriptionIn computer science, the longest increasing subsequence problem is to find a subsequence of a given sequence in wh... 阅读全文
posted @ 2014-11-02 11:30 Enumz 阅读(176) 评论(0) 推荐(0) 编辑
HDU5086——Revenge of Segment Tree(BestCoder Round #16)
摘要： Revenge of Segment TreeProblem DescriptionIn computer science, a segment tree is a tree data structure for storing intervals, or segments. It allows q... 阅读全文
posted @ 2014-11-02 11:22 Enumz 阅读(172) 评论(0) 推荐(0) 编辑