- 博客(2)
- 收藏
- 关注
RSS订阅原创 Max Sum
DP Max Sum Problem 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 + (-1) + 5 + 4 = 14. Input The first line of the input cont
2021-01-08 20:03:08
255
原创 背包_入门_题解
贪心 bone collector Many years ago , in Teddy’s hometown there was a man who was called “Bone Collector”. This man like to collect varies of bones , such as dog’s , cow’s , also he went to the grave … The bone collector had a big bag with a volume of V ,and
2021-01-08 13:18:21
534
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人