Sliding Window POJ - 2823 （单调栈）

题意：给你一个数组大小为n，有一个大小为k的窗口从左往右划过数组，要你输出每k个数组值中的最大值和最小值，分两行输出，第一行输出连续k个数字的最小值，第二行输出连续k个数字的最大值。

思路：很明显的单调栈问题。

#include<stdio.h>
const int N=1e6+5;
int a[N],minn[N],maxx[N],n,k,ansa[N],ansb[N];
int main()
{
    int head1,tail1,head2,tail2,i,kk;
    while(~scanf("%d%d",&n,&k))
    {
        kk=0,head1=0,tail1=-1,head2=0,tail2=-1;
        for(i=0;i<k;i++)
        {
            scanf("%d",&a[i]);
            while(head1<=tail1&&a[i]>a[maxx[tail1]]) tail1--;//维护单调递减序列
            maxx[++tail1]=i;
            while(head2<=tail2&&a[i]<a[minn[tail2]]) tail2--;//维护单调递增序列
            minn[++tail2]=i;
        }
        ansa[kk]=a[maxx[head1]];//存前k数的最大值
        ansb[kk++]=a[minn[head2]];//存前k数的最小值
        for(;i<n;i++)//窗口继续往后滑动
        {
            scanf("%d",&a[i]);
            while(head1<=tail1&&a[i]>a[maxx[tail1]]) tail1--;
            maxx[++tail1]=i;
            while(head2<=tail2&&a[i]<a[minn[tail2]]) tail2--;
            minn[++tail2]=i;
            while(i-maxx[head1]>=k) head1++;
            while(i-minn[head2]>=k) head2++;
            ansa[kk]=a[maxx[head1]];//每次存如当前窗口的最大值以及最小值
            ansb[kk++]=a[minn[head2]];
        }
        for(int i=0;i<=n-k;i++)//输出答案
            printf(i==n-k?"%d\n":"%d ",ansb[i]);
        for(int i=0;i<=n-k;i++)
            printf(i==n-k?"%d\n":"%d ",ansa[i]);
    }
}

An array of size n ≤ 10 6 is given to you. There is a sliding window of size k which is moving from the very left of the array to the very right. You can only see the k numbers in the window. Each time the sliding window moves rightwards by one position. Following is an example:
The array is [1 3 -1 -3 5 3 6 7], and k is 3.

Window position	Minimum value	Maximum value
[1  3  -1] -3  5  3  6  7	-1	3
1 [3  -1  -3] 5  3  6  7	-3	3
1  3 [-1  -3  5] 3  6  7	-3	5
1  3  -1 [-3  5  3] 6  7	-3	5
1  3  -1  -3 [5  3  6] 7	3	6
1  3  -1  -3  5 [3  6  7]	3	7

Your task is to determine the maximum and minimum values in the sliding window at each position.

Input

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.

Output

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.

Sample Input

8 3
1 3 -1 -3 5 3 6 7

Sample Output

-1 -3 -3 -3 3 3
3 3 5 5 6 7