动态规划
滑头鬼之亨
Frankiller
展开
-
uva 357 - Let Me Count The Ways
Let Me Count The WaysAfter making a purchase at a large department store, Mel's change was 17 cents. He received 1 dime, 1 nickel, and 2 pennies. Later that day, he was shopping at a con原创 2012-09-15 19:41:44 · 2433 阅读 · 0 评论 -
uva 10405 - Longest Common Subsequence
Problem C: Longest Common SubsequenceSequence 1: Sequence 2: Given two sequences of characters, print the length of the longest原创 2012-10-27 21:45:31 · 2184 阅读 · 0 评论 -
uva 103 - Stacking Boxes
Stacking BoxesBackgroundSome concepts in Mathematics and Computer Science are simple in one or two dimensions but become more complex when extended to arbitrary dimensions. Consider原创 2012-11-01 20:38:49 · 2572 阅读 · 1 评论 -
uva 10827 - Maximum sum on a torus
Problem HMaximum sum on a torusInput: Standard InputOutput:Standard OutputA grid that wraps both horizontally and vertically is called a torus. Given a torus where each cell contains an in原创 2012-10-23 20:14:27 · 2443 阅读 · 0 评论 -
uva 108 - Maximum Sum
Maximum SumBackgroundA problem that is simple to solve in one dimension is often much more difficult to solve in more than one dimension. Consider satisfying a boolean expression i原创 2012-10-23 18:57:56 · 2612 阅读 · 0 评论 -
uva 507 - Jill Rides Again
Jill Rides AgainJill likes to ride her bicycle, but since the pretty city of Greenhills where she lives has grown, Jill often uses the excellent public bus system for part of her journey. Sh原创 2012-10-15 21:11:19 · 2602 阅读 · 0 评论 -
uva 674 - Coin Change
Coin Change 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 money.For example, if we原创 2012-11-12 19:42:14 · 2177 阅读 · 0 评论