![](https://img-blog.csdnimg.cn/20201014180756916.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
C++题解
iaxiaoq
这个作者很懒,什么都没留下…
展开
-
[NWPU][2014][TRN][6]动态规划第一讲——简单线性dp_A题
题目: Description A military contractor for the Department of Defense has just completed a series of preliminary tests for a new defensive missile called the CATCHER which is capable of inte原创 2014-07-22 15:55:44 · 400 阅读 · 0 评论 -
[NWPU][2014][TRN][6]动态规划第一讲——简单线性dp_B题
题目: Description 7 3 8 8 1 0 2 7 4 4 4 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原创 2014-07-22 16:22:40 · 315 阅读 · 0 评论 -
[NWPU][2014][TRN][6]动态规划第一讲——简单线性dp-D题
题目: Description 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 +原创 2014-07-22 16:48:33 · 380 阅读 · 1 评论 -
[NWPU][2014][TRN][6]动态规划第一讲——简单线性dp_C题
题目: Description A subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = another sequence Z = is a subsequence of X原创 2014-07-22 16:42:07 · 333 阅读 · 0 评论