随笔分类 -  动态规划

恐怖的dp
1007 Maximum Subsequence Sum (25分)
摘要：1007 Maximum Subsequence Sum (25分) Given a sequence of K integers { N​1​​, N​2​​, ..., N​K​​ }. A continuous subsequence is defined to be { N​i​​, N​i 阅读全文
posted @ 2020-08-20 22:45 houyz 阅读(147) 评论(0) 推荐(0)