HDU 3415-Max Sum of Max-K-sub-sequence 单调队列
Given a circle sequence A[1],A[2],A[3]......A[n]. Circle sequence means the left neighbour of A[1] is A[n] , and the right neighbour of A[n] is A[1].
Now your job is to calculate the max sum of a Ma
原创
2016-07-21 18:32:47 ·
308 阅读 ·
0 评论