HDOJ1003

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,...

2017-04-10 23:47:03

阅读数:100

评论数:0

提示
确定要删除当前文章?
取消 删除
关闭
关闭