hdu 1231, dp ,maximum consecutive sum of integers, find the boundaries, possibly all negative, C++ 分类： hdoj 2015-07-12 03:24 87人阅读 评论(0) 收藏
摘要：
the algorithm of three version below is essentially the same, namely, Kadane’s algorithm, which is of O(n) complexity. https://en.wikipedia.or... 阅读全文
posted @ 2015-07-12 03:24 qeatzy 阅读(168) 评论(0) 推荐(0) 编辑
