![](https://img-blog.csdnimg.cn/20201014180756918.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
ACM__单调队列
wust_zwl
学不死,就往死里学。
展开
-
HDU 3415 Max Sum of Max-K-sub-sequence(单调队列)
Given a circle sequence A11,A22,A33......Ann. Circle sequence means the left neighbour of A11 is Ann , and the right neighbour of Ann is A11. Now your job is to calculate the max sum of a Max-K-sub-sequence. Max-K-sub-sequence means a continuous non-empty原创 2017-07-11 09:42:09 · 253 阅读 · 0 评论 -
POJ 2823 Sliding Window(经典单调队列)
An array of size n ≤ 10 6 is given to you. There is a sliding window of size k which is moving from the very left of the array to the very right. You can only see the k numbers in the window. Each time the sliding window moves rightwards by one position. F原创 2017-07-10 22:00:44 · 235 阅读 · 0 评论 -
单调队列优化DP详解
细说单调队列优化dp原理及效率提升对比~转载 2017-08-07 10:14:49 · 2794 阅读 · 0 评论