https://111qqz.com/en/tags/%E5%8D%95%E8%B0%83%E9%98%9F%E5%88%97/Recent content in 单调队列 on 111qqz's blogHugo -- gohugo.ioen© 2015-2026 111qqzFri, 05 Aug 2016 12:32:50 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-08-05-hdu-3415/Fri, 05 Aug 2016 12:32:50 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-08-05-hdu-3415/<p><a href="http://acm.hdu.edu.cn/showproblem.php?pid=3415" target="_blank" rel="noreferrer">hdu 3415</a> 题意：给出n个整数，是一个环（也就是a[n]右边是a[1]）求一段长度不超过k的数使得和最大，问最大和是多少并给出这段数的位置。</p>https://111qqz.com/en/post/acm-icpc/2016/2016-08-04-ural1126/Thu, 04 Aug 2016 16:04:14 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-08-04-ural1126/<p><a href="http://acm.timus.ru/problem.aspx?space=1&amp;num=1126" target="_blank" rel="noreferrer">ural 1126</a> 题意：n个数，求从第k个元素开始，求每k个元素的最大值（一共求n-k+1次） 思路：单调队列。 <a href="http://blog.csdn.net/dgq8211/article/details/7430726" target="_blank" rel="noreferrer">单调队列学习链接</a> 其实单调队列挺容易的理解的。。。当时觉得写不明白大概是因为看到的代码写得太丑了2333</p>https://111qqz.com/en/post/acm-icpc/2015/2015-07-29-poj2823/Wed, 29 Jul 2015 13:03:00 +0000https://111qqz.com/en/post/acm-icpc/2015/2015-07-29-poj2823/<p>Sliding Window</p> <p>看这个问题：An array of size <em>n</em> ≤ 106 is given to you. There is a sliding window of size <em>k</em> which is moving from the very left of the array to the very right. You can only see the <em>k</em> numbers in the window. Each time the sliding window moves rightwards by one position.Your task is to determine the maximum and minimum values in the sliding window at each position.</p>