POJ 2823 Sliding Window

Description
An array of size n ≤ 106 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 Input8 3
1 3 -1 -3 5 3 6 7
 

#include <iostream>
#include <cstdio>
using namespace std;

#define MAX 1000001
int A[MAX]; //存储数据
int Q[MAX]; //队列
int P[MAX]; //存储A[i]中的下标i
int Min[MAX];  //输出最小
int Max[MAX];  //输出最大
int n,k;

void get_min(){
    int i;
    int head=1,tail=0;
    for(i=0; i<k-1; i++)  //先把前两个入队
    {
        while(head<=tail && Q[tail]>=A[i])  //队尾元素大于要插入的数
            --tail;
        Q[++tail]=A[i];
        P[tail]=i;
    }

    for(; i<n; i++){
        while(head<=tail && Q[tail]>=A[i])
            --tail;
        Q[++tail]=A[i];
        P[tail]=i;
        while(P[head]<i-k+1)
            head++;
        Min[i-k+1]=Q[head];
    }
}

void get_max()
{
    int i;
    int head=1,tail=0;
    for(i=0; i<k-1; i++){
        while(head<=tail && Q[tail]<=A[i])   //队尾元素小于要插入的值
            --tail;
        Q[++tail]=A[i];
        P[tail]=i;
    }
    for(; i<n; i++){
        while(head<=tail && Q[tail]<=A[i])   //队尾元素小于要插入的值
            --tail;
        Q[++tail]=A[i];
        P[tail]=i;
        while(P[head]<i-k+1){
            head++;
        }
        Max[i-k+1]=Q[head];
    }
}

void output(){
       int i;
       for(i=0; i<n-k+1; i++){
           if(i==0)
               printf("%d",Min[i]);
           else
               printf(" %d",Min[i]);
       }
       printf("\n");
       for(i=0; i<n-k+1; i++){
           if(i==0)
               printf("%d",Max[i]);
           else
               printf(" %d",Max[i]);
       }
       printf("\n");
}

int main()
{
    int i;
    scanf("%d%d",&n,&k);
    for(i=0; i<n; i++)
        scanf("%d",&A[i]);
    get_min();
    get_max();
    output();
    return 0;
}