![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
动态规划
文章平均质量分 83
Misdom_Tian_Ya
这个作者很懒,什么都没留下…
展开
-
hdu 1114 Piggy-Bank (完全背包)
DescriptionBefore ACM can do anything, a budget must be prepared and the necessary financial support obtained. The main income for this action comes from Irreversibly Bound Money (IBM). The idea beh原创 2014-09-27 13:36:27 · 537 阅读 · 0 评论 -
poj 3628 Bookshelf 2(0/1背包)
DescriptionFarmer John recently bought another bookshelf for the cow library, but the shelf is getting filled up quite quickly, and now the only available space is at the top.FJ has N cows (1 ≤原创 2014-09-27 13:00:09 · 539 阅读 · 0 评论 -
HDU 1003 Max Sum
DescriptionGiven 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 = 1原创 2014-12-11 19:09:00 · 413 阅读 · 0 评论 -
POJ 1163 The Triangle (动态规划)
Description73 88 1 02 7 4 44 5 2 6 5(Figure 1)Figure 1 shows a number triangle. Write a program that calculates the highest sum of numbers passed on a route that starts at th原创 2015-03-16 17:03:52 · 354 阅读 · 0 评论 -
2015编程之美 回文字符序列(区间Dp)
给定字符串,求它的回文子序列个数。回文子序列反转字符顺序后仍然与原序列相同。例如字符串aba中,回文子序列为"a", "a", "aa", "b", "aba",共5个。内容相同位置不同的子序列算不同的子序列。输入第一行一个整数T,表示数据组数。之后是T组数据,每组数据为一行字符串。输出对于每组数据输出一行,格式为"Case #X: Y",X代表数据编号(从1开始),Y为答原创 2015-04-18 14:35:48 · 612 阅读 · 0 评论 -
HDU 1024 Max Sum Plus Plus
Problem DescriptionNow I thinkyou have got an AC in Ignatius.L's "Max Sum" problem. To be a braveACMer, we always challenge ourselves to more difficult problems. Now you arefaced with a more difficu原创 2015-04-24 10:31:53 · 399 阅读 · 0 评论 -
第四届 Mountain Subsequences
DescriptionCoco is a beautiful ACMer girl living in a very beautiful mountain. There are many trees and flowers on the mountain, and there are many animals and birds also. Coco like the mountain so mu原创 2015-05-05 21:01:22 · 365 阅读 · 0 评论