摘要： 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... 阅读全文

摘要： 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... 阅读全文

摘要： Problem Description：In computer science, the longest increasing subsequence problem is to find a subsequence of a given sequence in which the subseque... 阅读全文