单调队列:
一个长度为k的窗口,求每向右移动一步输出窗口中的最大值和最小值。我们可以在用一个递增和递减队列来分别维护。此题好好练练队列的原理,对以后优化决策单调的dp问题很有用处。acmer,fighting~~~相信自己无极限
举个列子吧,让大家好好理解:(以递增队列为例)
1 3 -1 -3 5 3 6 7(其中n = 8, k = 3(窗口大小))
i 队列中的元素
i = 1 (1, 1)
i = 2 (1, 1), (3, 2)
i = 3 (-1 , 3) (要保持插入的元素比队尾大,除队列为空)
i = 4 (-3, 4)
i = 5 (-3, 4), (5, 5)
i = 6 (3, 6) (由于要保证窗口中的数目不能超过k个)
i = 7 (3, 6), (6, 7)
i = 8 (6, 7), (7, 8)
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
const int maxn = 1000000 + 10;
int data[maxn];
int que1[maxn];
int que2[maxn];
int main()
{
int n, k;
while(scanf("%d%d", &n, &k) != EOF){
for(int i = 1; i <= n; i ++)
scanf("%d", &data[i]);
int l1, r1, l2, r2;
// l1为队列的头部,r1为队列的尾部
l1 = r1 = l2 = r2 = 0;
for(int i = 1; i < k; i ++){
while(l1 < r1 && que1[l1] < i-k)
// 确保队列中的数量为k
l1 ++ ;
while(l1 < r1 && data[que1[r1-1]] < data[i])
// 插入的元素要比队尾大,如果小则弹出队尾元素
r1 -- ;
que1[r1++] = i;
while(l2 < r2 && que1[l2] < i-k)
l2 ++ ;
while(l2 < r2 && data[que2[r2-1]] > data[i])
r2 -- ;
que2[r2++] = i;
}
for(int i = k; i <= n; i ++){
while(l2 < r2 && que2[l2] < i-k+1)
l2 ++ ;
while(l2 < r2 && data[que2[r2-1]] > data[i])
r2 -- ;
que2[r2++] = i;
cout << data[que2[l2]];
if(i < n) cout << " ";
else cout << endl;
}
for(int i = k; i <= n; i ++){
while(l1 < r1 && que1[l1] < i-k+1)
l1 ++ ;
while(l1 < r1 && data[que1[r1-1]] < data[i])
r1 -- ;
que1[r1++] = i;
cout << data[que1[l1]];
if(i < n) cout << " ";
else cout << endl;
}
}
return 0;
}