2016年4月2日
HDU1159 && POJ1458：Common Subsequence(LCS)
摘要： Problem Description A subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = <x1, x2, 阅读全文
posted @ 2016-04-02 22:21 邻家那小孩儿 阅读(131) 评论(0) 推荐(0)
poj 2533 Longest Ordered Subsequence(LIS)
摘要： Description A numeric sequence of ai is ordered ifa1 <a2 < ... < aN. Let the subsequence of the given numeric sequence (a1,a2, ..., aN) be any sequenc 阅读全文
posted @ 2016-04-02 21:35 邻家那小孩儿 阅读(108) 评论(0) 推荐(0)
poj 1163 The Triangle
摘要： Description Figure 1 shows a number triangle. Write a program that calculates the highest sum of numbers passed on a route that starts at the top and ends somewhere 阅读全文
posted @ 2016-04-02 19:56 邻家那小孩儿 阅读(122) 评论(0) 推荐(0)