2015年3月19日
01-复杂度2. Maximum Subsequence Sum (25)
摘要： Given a sequence of K integers { N1, N2, ..., NK}. A continuous subsequence is defined to be { Ni, Ni+1, ..., Nj} where 1 //using namespace std;//cons... 阅读全文
posted @ 2015-03-19 15:53 wpnan 阅读(1134) 评论(0) 推荐(0) 编辑