2015年6月17日
[LintCode] Maximum Subarray Difference
摘要： Maximum Subarray DifferenceGiven an array with integers.Find twonon-overlappingsubarrays A and B, which|SUM(A) - SUM(B)|is thelargest.Return the large... 阅读全文
posted @ 2015-06-17 15:17 Eason Liu 阅读(262) 评论(0) 推荐(0)
[HDU 3415] Max Sum of Max-K-sub-sequence
摘要： Max Sum of Max-K-sub-sequenceProblem DescriptionGiven a circle sequence A[1],A[2],A[3]......A[n]. Circle sequence means the left neighbour of A[1] is ... 阅读全文
posted @ 2015-06-17 11:12 Eason Liu 阅读(323) 评论(0) 推荐(0)