poj 2823

 题目描述：

 

    

Sliding Window

Time Limit: 12000MS		Memory Limit: 65536K
Total Submissions: 16559		Accepted: 4745
Case Time Limit: 5000MS

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

Source

POJ Monthly--2006.04.28, Ikki

      这道题主流的解法有两个，一个是线段树，另一个是单调队列。这里我是用单调队列过的。单调队列的相关知识可以去一下链接：

http://xy117510.blog.163.com/blog/static/6493242920105138615328/

这里我就不在多说单调队列的相关知识了，说说自己的感悟，就是针对一种特定性质的单调队列可以由两条队列“复合”而成，一个管理要求的最值，另一个用于维护下标范围（可以联想一下我们平时解dp题时是怎么做的，是不是状态转移时都有一个范围？^_^)。感觉上单调队列很适合解决线性dp，比如区间最值、区间和最值等。

以下是AC代码，5000+ms的，自己手写scanf和printf可以提速到800+ms

1. #include "stdio.h"
   #include "string.h"
   const int M=1000005;
   int arr[M];
   int Minq[M],Maxq[M];
   int Q[M],Inq[M];
   int n,k;
2. void Min()
   {
    int head=1,tail=0;
    int i;
    for(i=1;i<=n;i++)
    {
     while(head<=tail && Q[tail]>arr[i])
      tail--;
     tail++;
     Q[tail]=arr[i];
     Inq[tail]=i;
     if(i>=k)
     {
      while(Inq[head]<=i-k) head++;
      Minq[i-k]=Q[head];
     }
    }
   }
3. void Max()
   {
    int head=1,tail=0;
    int i;
    for(i=1;i<=n;i++)
    {
     while(head<=tail && Q[tail]<arr[i])
      tail--;
     tail++;
     Q[tail]=arr[i];
     Inq[tail]=i;
     if(i>=k)
     {
      while(Inq[head]<=i-k) head++;
      Maxq[i-k]=Q[head];
     }
    }
   }
4. int main()
   {
    freopen("in.txt","r",stdin);
    while(scanf("%d%d",&n,&k)==2)
    {
     if(k>n) k=n;
     int i;
     for(i=1;i<=n;i++)
      scanf("%d",&arr[i]);
     Min();
     Max();
     for(i=0; i<n-k+1; i++)  
               printf("%d%c", Minq[i], (i < n - k) ? ' ' : '/n');   
           for(i=0; i<n-k+1; i++)  
               printf("%d%c", Maxq[i], (i < n - k) ? ' ' : '/n');   
    }
    return 0;
   }