单调队列
左眼皮跳跳~
这个作者很懒,什么都没留下…
展开
-
POJ 2823 Sliding Window (单调队列)
Sliding WindowTime Limit: 12000MS Memory Limit: 65536KTotal Submissions: 42278 Accepted: 12479Case Time Limit: 5000MSDescriptionAn array of size n ≤ 106 i原创 2015-04-14 17:34:06 · 607 阅读 · 0 评论 -
HDU 3530 Subsequence(单调队列)
Problem DescriptionThere is a sequence of integers. Your task is to find the longest subsequence that satisfies the following condition: the difference between the maximum element and the minimum el原创 2015-04-14 20:27:03 · 509 阅读 · 0 评论 -
HDU 3415 Max Sum of Max-K-sub-sequence(单调队列)
Problem DescriptionGiven 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原创 2015-04-14 18:18:40 · 468 阅读 · 0 评论 -
HDU Non-negative Partial Sums (单调队列)
Problem DescriptionYou are given a sequence of n numbers a0,..., an-1. A cyclic shift by k positions (0k ak+1,..., an-1, a0, a1,..., ak-1. How many of the n cyclic shifts satisfy the condition tha原创 2015-04-14 17:08:00 · 686 阅读 · 0 评论