描述
给你n个数,求每部分连续的m个数里面的最大值最小值。
http://poj.org/problem?id=2823
输入
The input consists of two lines. The first line contains two integers n and k which are the lengths of the array and the sliding window. There are n integers in the second line.
输出
There are two lines in the output. The first line gives the minimum values in the window at each position, from left to right, respectively. The second line gives the maximum values.
样例
输入
8 3
1 3 -1 -3 5 3 6 7
输出
-1 -3 -3 -3 3 3
3 3 5 5 6 7
这个题可以用单调队列来做,并且这是个模板题。
这个题有两部分,最大值和最小值,其实你会一种就行了,因为另一种改个符号即可!
代码:
#include<bits/stdc++.h>
using namespace std;
int n,k,a[1000001],id[1000001],dl[1000001],l=<