POJ--2823--Sliding Window----单调队列问题

Sliding Window

Time Limit:12000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u

Description

An array of size n ≤ 10 ⁶ 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
題意 :
　　给定一个数字序列,与每次所能看见的序列长度m即窗户长度,从左向右依次移动窗户,输出每次所能看到的序列长度的最大值与最小值,直到序列结束.
思路:
　　以求最小值为例,
　　1.构造递增的单调队列,即队尾元素需要小于当前元素,否则队尾元素出队.
　　2.首先,将前 m-1 个元素按照单调队列原则进队,并记录队列中的每个元素在数组中的下标;
　　　其次,将剩余的元素依次进队,以 第i元素为例子,将第i元素与队尾比较,若是小于队尾,则队尾出队,否则当前元素进队,此时队列是单调递增有序的,
　　　再之,将队头元素的下标与当前元素的下标比较,若 当前元素下标 - 队头元素下标<=m-1,则队头元素便为最小值,否则队头出队.
　　3.将剩余元素依次进行步骤2,便得到所求的所有最小值,求最大值亦然.
AC代码分析 (请用C++提交,否则Time Limit Exceeded):

 #include <iostream>
 #include <stdio.h>
 #include <cstring>
 #include <algorithm>
 #include <cmath>
 #include <vector>
 #include <map>
 #include<string.h>
 #include<stack>
 #include<set>
 #include <queue>
 using namespace std;
 int a[];
 //队列中各元素的下标
 int p[];
 //各个区间的最大值
 int max1[];
 //各个区间的最小值
 int min1[];
 //数组模拟递增队列
 int qmax[];
 //数组模拟递减队列
 int qmin[];
 //队头,队尾
 int head,tail;
 int main()
 {
     int n,m,i,t;
     while(~scanf("%d%d",&n,&m))
     {
         for( i = ; i<=n; i++) scanf("%d",a+i);
         //队头队尾初始化
         head = ;
         tail = ;
         t = ;
         //前m-1个元素进队列
         for( i = ; i<=m-; i++)
         {
             while(head<=tail&&qmin[tail]>=a[i]) tail--;
             qmin[++tail] = a[i];
             //队列中各元素的下标
             p[tail] = i;

         }
         //求所有的最小值
         for(; i<=n; i++)
         {
             //进队
             while(head<=tail&&qmin[tail]>=a[i]) tail--;
             qmin[++tail] = a[i];
             p[tail] = i;
             //判断对头是否在当前范围内
             while(i-p[head]>m-)
                 head++;
             min1[t++] = qmin[head];
         }
         head = ;
         tail = ;
         t = ;
         //求所有的最大值
         for( i = ; i<=m-; i++)
         {
             while(head<=tail&&qmax[tail]<=a[i]) tail--;
             qmax[++tail] = a[i];
             p[tail] = i;
         }
         for(; i<=n; i++)
         {
             //进队
             while(head<=tail&&qmax[tail]<=a[i]) tail--;
             qmax[++tail] = a[i];
             p[tail] = i;
             //判断对头是否在当前范围内
             while(i-p[head]>m-)
                 head++;
             max1[t++] = qmax[head];
         }
         for( i = ; i<t; i++)
         {
             if(i == )
                 printf("%d",min1[i]);
             else
                 printf(" %d",min1[i]);
         }
         printf("\n");
         for( i = ; i<t; i++)
         {
             if(i == )
                 printf("%d",max1[i]);
             else
                 printf(" %d",max1[i]);
         }

     }
     return ;
 }

本文为个人随笔,如有不当之处,望各位大佬多多指教.
若能为各位博友提供小小帮助,不胜荣幸.