01-复杂度2 Maximum Subsequence Sum (25分)
摘要：
Given a sequence of KKK integers { N1N_1N1, N2N_2N2, ..., NKN_KNK }. A continuous subsequence is defined to be { NiN_iNi, Ni+1N_{i+1}Ni+1 阅读全文
posted @ 2016-09-25 12:02 acmtime 阅读(860) 评论(0) 推荐(0) 编辑
