#include <iostream>
#include <cstdio>

using namespace std;

const int MAX = 1000009;

int arr[MAX];
int n,k;
int v[MAX],id[MAX];
int min_queue[MAX];
int max_queue[MAX];

int front,rear;

int main()
{
    while(scanf("%d%d",&n,&k)!=EOF)
    {
        for(int i=1;i<=n;i++)
    {
        scanf("%d",&arr[i]);
    }
    front=rear=1;
    for(int i=1;i<k;i++)
    {
        while(front!=rear && v[rear-1]>arr[i]) rear--;
        v[rear]=arr[i];
        id[rear++]=i;
    }
    for(int i=k;i<=n;i++)
    {
        while(front!=rear && v[rear-1]>arr[i]) rear--;
        v[rear]=arr[i];
        id[rear++]=i;
        while(front!=rear && i-id[front]+1>k) front++;
        min_queue[i]=v[front];
    }
    printf("%d",min_queue[k]);
    for(int i=k+1;i<=n;i++) printf(" %d",min_queue[i]);
    printf("\n");
    front=rear=1;

    for(int i=1;i<k;i++)
    {
        while(front!=rear && v[rear-1]<arr[i]) rear--;
        v[rear]=arr[i];
        id[rear++]=i;
    }
    for(int i=1;i<=n;i++)
    {
        while(front!=rear && v[rear-1]<arr[i]) rear--;
        v[rear]=arr[i];
        id[rear++]=i;
        while(front!=rear && i-id[front]+1>k) front++;
         max_queue[i]=v[front];
    }
    printf("%d",max_queue[k]);
    for(int i=k+1;i<=n;i++) printf(" %d",max_queue[i]);
    printf("\n");
    }

    return 0;
}
-------------------------------------------------------------------
写的好恶心啊，见谅，见谅。

• Re:g++换成C++便不超时了 (14) pipilupe 2017-06-23 16:19:21
• Re:g++换成C++便不超时了 (11) YoungNeal 2018-02-12 22:47:41
• Re:g++换成C++便不超时了 (6) iNx 2020-04-15 15:56:34