A-max sum <HDU 1003>
摘要：
A-max sum 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 阅读全文
posted @ 2018-07-06 20:25 虚虚 阅读(202) 评论(0) 推荐(0) 编辑
