Volume4-动态规划
文章平均质量分 82
c随遇er安
上得了厅堂 下得了厨房 写得了代码 把得了姑娘 小清醒Coder一枚
展开
-
UVaOJ111 - History Grading
111 - History Grading Time limit: 3.000 seconds Background Many problems in Computer Science involve maximizing some measure according to constraints. Consider a history exam in which studen原创 2013-05-23 18:43:17 · 651 阅读 · 0 评论 -
UVaOJ103 - Stacking Boxes
103 - Stacking Boxes Time limit: 3.000 seconds Background Some concepts in Mathematics and Computer Science are simple in one or two dimensions but become more complex when extended to arbitr原创 2013-05-23 18:47:17 · 654 阅读 · 0 评论 -
UVaOJ10405 - Longest Common Subsequence
10405 - Longest Common Subsequence Time limit: 3.000 seconds Sequence 1: Sequence 2: Given two sequences of characters, print the length of the longest co原创 2013-05-23 18:52:01 · 550 阅读 · 0 评论 -
UVaOJ674 - Coin Change
674 - Coin Change Time limit: 3.000 seconds Suppose there are 5 types of coins: 50-cent, 25-cent, 10-cent, 5-cent, and 1-cent. We want to make changes with these coins for a given amount of mone原创 2013-05-23 18:58:35 · 540 阅读 · 0 评论 -
UVaOJ10003 - Cutting Sticks
10003 - Cutting Sticks Time limit: 3.000 seconds You have to cut a wood stick into pieces. The most affordable company, The Analog Cutting Machinery, Inc. (ACM), charges money according to the l原创 2013-05-28 22:56:43 · 649 阅读 · 0 评论