- 博客(4)
- 资源 (18)
- 收藏
- 关注
RSS订阅原创 [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
369
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
329
原创 [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
310
原创 [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
395
Cellular_Automata_Modeling_of_Physical_Systems 物理系统的元胞自动机模拟
2019-03-28
Neural Networks and Deep Learning 神经网络与深度学习 的代码
2018-09-04
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人