« 博客园首页

hdu 1003 Max Sum

ion(s): 42082 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,
lucky_少哖 2015-08-23 浏览(19)
http://www.cnblogs.com/pshw/p/4752326.html