随笔分类 -  水题

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 阅读(1155) 评论(0) 推荐(0)
hdu 1236 1.3.2排名
摘要：排名Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3690 Accepted Submission(s): 1171Problem Descri... 阅读全文
posted @ 2014-11-11 16:27 wpnan 阅读(143) 评论(0) 推荐(0)