UVA
文章平均质量分 95
益达915
一名在读大学生,渣渣一枚,进取中...
展开
-
Uva | Cutting Sticks
原题You have to cut a wood stick into pieces. The most affordable company, The Analog Cutting Machinery,Inc. (ACM), charges money according to the length of the stick being cut. Their procedure of work r原创 2016-08-17 16:45:15 · 934 阅读 · 0 评论 -
UVA | Optimal Binary Search Tree
原题题目链接:https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=514&page=show_problem&problem=1245Given a set S = (e1, e2, …, en) of n distinct elements such that e1 < e2 < … < en原创 2016-08-17 20:17:32 · 1068 阅读 · 0 评论 -
UVA | Coin Change
引入Coin Changing Minimum Coins Dynamic Programming 给出N中不同金额的硬币,每种金币有无限多个。给定一个金额M,问最少需要多少个硬币可以凑成M?熟悉的朋友一看这道题就知道是完全DP,具体也没有什么好说的了,不过这里还是推一推。由Subset Sum Problem的推导我们知道,01背包其i状态完全依赖于i-1状态,在不需要还原具体解是如何的情况下,原创 2016-08-19 10:45:22 · 290 阅读 · 0 评论