![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
--- Dynamic Programming ---
文章平均质量分 80
Chlerry
We're all just prisoners here, of our own device.
展开
-
[ACdream]娜娜梦游仙境系列——吃不完的糖果
娜娜好不容易才在你的帮助下"跳"过了这个湖,果然车到山前必有路,大战之后必有回复,大难不死,必有后福!现在在娜娜面前的就是好多好多的糖果还有一些黑不溜秋的东西!不过娜娜眼中只有吃不完的糖果!娜娜高兴地快要蹦起来了!原创 2015-04-14 12:03:19 · 696 阅读 · 0 评论 -
[UVa 11400]Lighting System Design
Problem DescriptionYou are given the task to design a lighting system for a huge conference hall. After doing a lot of calculation and sketching, you have figured out the requirements for an energy-eff原创 2015-08-18 15:35:07 · 290 阅读 · 0 评论 -
[UVa 11584]Partitioning by Palindromes
We say a sequence of char- acters is a palindrome if it is the same written forwards and backwards. For example, ‘racecar’ is a palindrome, but ‘fastcar’ is not.原创 2015-08-18 16:27:07 · 412 阅读 · 0 评论 -
[UVa 1626]Brackets sequence
[UVa 1626]Brackets sequence原创 2015-08-19 13:02:19 · 422 阅读 · 0 评论 -
[UVa10003]Cutting Sticks
[UVa10003]Cutting Sticks原创 2015-08-18 23:19:53 · 258 阅读 · 0 评论 -
[UVa 1625]Color Length
Problem DescriptionMy Problem Report这是道非常值得总结的题。通过这道题我对两个概念的理解加深了很多: 无后效性原则 最优子结构 在做动态规划的时候,我们需要明白一点,就是当前状态一定是由过去的状态(也就是最优子结构)转移而来的,而不是说过去的状态影响了现在的状态。我们在对状态进行转移时,要充分意识到三点: 过去的状态一定是最优的,我们原创 2015-09-09 20:40:37 · 399 阅读 · 0 评论 -
[UVa 1625]Color Length
[UVa 1625]Color Length原创 2015-08-18 20:55:01 · 183 阅读 · 0 评论 -
[UVa1331]Minimax Triangulation
[UVa1331]Minimax Triangulation原创 2015-08-19 20:16:56 · 311 阅读 · 0 评论 -
[Codeforces Round #318 ]Bear and Blocks
Limak is a little bear who loves to play. Today he is playing by destroying block towers. He built n towers in a row. The i-th tower is made of hi identical blocks.原创 2015-09-09 19:51:11 · 289 阅读 · 0 评论 -
[POJ3342]Party at Hali-Bula
Dear Contestant,I’m going to have a party at my villa at Hali-Bula to celebrate my retirement from BCM. I wish I could invite all my co-workers, but imagine how an employee can enjoy原创 2015-09-16 16:33:46 · 259 阅读 · 0 评论 -
[POJ1655]Balancing Act
Consider a tree T with N (1 <= N <= 20,000) nodes numbered 1…N. Deleting any node from the tree yields a forest: a collection of one or more trees. Define the balance of a node to be原创 2015-09-16 21:11:05 · 256 阅读 · 0 评论 -
[UVa 10118]Free Candies
Problem DescriptionLittle Bob is playing a game. He wants to win some candies in it - as many as possible.原创 2015-08-12 20:13:13 · 270 阅读 · 0 评论 -
[UVa 1394]And Then There Was One
Let’s play a stone removing game. Initially, n stones are arranged on a circle and numbered 1,…, n clockwise原创 2015-08-14 11:42:53 · 184 阅读 · 0 评论 -
[UVa 437]The Tower of Babylon
Perhaps you have heard of the legend of the Tower of Babylon. Nowadays many details of this tale have been forgotten. So now, in line with the educational nature of this contest, we原创 2015-08-15 20:28:48 · 288 阅读 · 0 评论 -
[The 2015 Shanghai Invitational Programming Contest]Seam Carving
DescriptionFish likes to take photo with his friends. Several days ago, he found that some pictures of him were damaged. The trouble is that there are some seams across the pictures.原创 2015-04-26 10:54:21 · 398 阅读 · 0 评论 -
[UVa 12563]Jin Ge Jin Qu hao
Problem Description(If you smiled when you see the title, this problem is for you ^_^) For those who don’t know KTV, see: http://en.wikipedia.org/wiki/Karaoke_box There is one very popular song calle原创 2015-08-17 16:15:51 · 292 阅读 · 0 评论 -
Longest Increasing Subsequence
Longest Increasing Subsequence原创 2015-08-14 15:48:51 · 259 阅读 · 0 评论 -
[UVa 116]Unidirectional TSP
Problem DescriptionProblems that require minimum paths through some domain appear in many different areas of computer science. For example, one of the constraints in VLSI routing problems is minimizing原创 2015-08-16 23:21:02 · 327 阅读 · 0 评论 -
[UVa 10534]Wavio Sequence
Problem DescriptionWavio is a sequence of integers. It has some interesting properties. • Wavio is of odd length i.e. L = 2 ∗ n + 1. • The first (n + 1) integers of Wavio sequence makes a strictly in原创 2015-08-14 16:32:33 · 424 阅读 · 0 评论 -
[UVa 10285]Longest Run on a Snowboard
Problem DescriptionMichael likes snowboarding. That’s not very surprising, since snowboarding is really great. The bad thing is that in order to gain speed, the area must slide downwards.原创 2015-08-12 20:24:02 · 391 阅读 · 0 评论 -
[UVa 1629]Cake Slicing
DescriptionA rectangular cake with a grid of m*n unit squares on its top needs to be sliced into pieces. Several cherries are scattered on the top of the cake with at most one cherry on a unit square.原创 2015-08-12 19:56:38 · 373 阅读 · 0 评论 -
Longest Commom Subsequences Problem
到网上参考了很多博客和资料,发现讲得都太复杂。反而是常被吐槽的《算法导论》讲得最清楚、明了。原创 2015-08-17 18:19:34 · 292 阅读 · 0 评论 -
[UVa 1347]Tour
Problem DescriptionJohn Doe, a skilled pilot, enjoys traveling. While on vacation, he rents a small plane and starts visiting beautiful places. To save money, John must determine the shortest closed to原创 2015-08-16 19:54:19 · 250 阅读 · 0 评论 -
[UVa 1025]A Spy in the Metro
Secret agent Maria was sent to Algorithms City to carry out an especially dangerous mission. After several thrilling events we find her in the first station of Algorithms City Metro,原创 2015-08-15 16:39:13 · 233 阅读 · 0 评论 -
[HDU1003]Max Sum
Given a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the max sum in this sequence is 6 + (-1) + 5 + 4 = 14.原创 2015-04-13 21:16:25 · 247 阅读 · 0 评论