
单调队列
Stephencurry‘s csdn
这个作者很懒,什么都没留下…
展开
-
Subsequence(HDU-3530)(单调队列)
There 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 element of the subseque...原创 2019-08-02 17:18:42 · 272 阅读 · 0 评论 -
Second My Problem First (HDU-3706)(单调队列)
Give you three integers n, A and B.Then we define Si= Aimod B and Ti= Min{ Sk| i-A <= k <= i, k >= 1}Your task is to calculate the product of Ti(1 <= i <= n) mod B.Input...原创 2019-08-03 09:23:03 · 241 阅读 · 0 评论 -
Fence (POJ-1821)(单调队列+优化dp)
A team of k (1 <= K <= 100) workers should paint a fence which contains N (1 <= N <= 16 000) planks numbered from 1 to N from left to right. Each worker i (1 <= i <= K) should sit ...原创 2019-08-05 10:10:56 · 669 阅读 · 0 评论 -
Sliding Window (POJ-2823)(单调队列)
An array of sizen≤ 106is given to you. There is a sliding window of sizekwhich is moving from the very left of the array to the very right. You can only see theknumbers in the window. Each time...原创 2019-07-27 09:31:02 · 90 阅读 · 0 评论 -
Queue (Codeforces 91B)(单调队列)
There arenwalruses standing in a queue in an airport. They are numbered starting from the queue's tail: the1-st walrus stands at the end of the queue and then-th walrus stands at the beginning of ...原创 2019-08-02 09:56:46 · 623 阅读 · 0 评论