poj2823 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.

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

单调队列练习，求最大值时维护一个递减的单调队列，最小值相反，需要注意的是这题对stl不友好（差点t，还有就是教的时候用c++编译器而不是g++（我也不知道为什么。
代码如下

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<queue>
using namespace std;
const int sz = 2000010;
int num[sz];
int n,m;
deque < int > q;
int read()
{
    int x = 0 , f = 1;
    char in = getchar();
    while(in < '0' || in > '9')
    {
        if(in == '-')
            f = -1;
        in = getchar();
    }
    while('0' <= in && in <= '9')
    {
        x = (x << 3) + (x << 1) + (in - '0');
        in = getchar(); 
    }
    return x * f;
}
void make_first_ans()
{
    for(int i = 1 ; i <= m ; i ++)
    {
        while(!q.empty() && num[q.back()] > num[i])
            q.pop_back();
        q.push_back(i);
    }
    printf("%d ",num[q.front()]);
    for(int i = m + 1 ; i <= n ; i ++)
    {
        while(!q.empty() && num[q.back()] > num[i])
            q.pop_back();
        while(!q.empty() && q.front() < i - m + 1)
            q.pop_front();
        q.push_back(i);
        printf("%d ",num[q.front()]);
    }
}
void make_second_ans()
{
    for(int i = 1 ; i <= m ; i ++)
    {
        while(!q.empty() && num[q.back()] < num[i])
            q.pop_back();
        q.push_back(i);
    }
    printf("%d ",num[q.front()]);
    for(int i = m + 1 ; i <= n ; i ++)
    {
        while(!q.empty() && num[q.back()] < num[i])
            q.pop_back();
        while(!q.empty() && q.front() < i - m + 1)
            q.pop_front();
        q.push_back(i);
        printf("%d ",num[q.front()]);
    }
}
int main()
{
    n = read() , m = read();
    for(int i = 1 ; i <= n ; i ++)
        num[i] = read();
    make_first_ans();
    puts("");
    while(!q.empty())
        q.pop_back();
    make_second_ans();
    return 0;
}