2015年11月4日
HDU 5101 Select（BestCoder Round #17）
摘要： Problem Description：One day, Dudu, the most clever boy, heard of ACM/ICPC, which is a very interesting game. He wants to take part in the game. But as... 阅读全文
posted @ 2015-11-04 19:08 搁浅の记忆 阅读(232) 评论(0) 推荐(0)
HDU 5100 Chessboard（BestCoder Round #17）（找规律）
摘要： Problem Description：Consider the problem of tiling an n×n chessboard by polyomino pieces that are k×1 in size; Every one of the k pieces of each polyo... 阅读全文
posted @ 2015-11-04 15:54 搁浅の记忆 阅读(150) 评论(0) 推荐(0)
HDU 5087 Revenge of LIS II（BestCoder Round #16）（次长上升子序列）
摘要： Problem Description：In computer science, the longest increasing subsequence problem is to find a subsequence of a given sequence in which the subseque... 阅读全文
posted @ 2015-11-04 11:38 搁浅の记忆 阅读(158) 评论(0) 推荐(0)