UOJ Logo LFYZ Online Judge

LFYZOJ

#8. 【模板】单调队列(Sliding Window)

统计

问题描述

An array of size $n\leq10^6$ 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.

给你一个大小为 $n$($n \leq 10^6$)的数组,问你长度为 $k$ 的连续区间内的最小值最大值。

示意表

Your task is to determine the maximum and minimum values in the sliding window at each position.

输入格式

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.

第一行是 $n$ 和 $k$。

第二行是 $n$ 个整数。

输出格式

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.

输出两行。

第一行是 $n-k+1$ 个整数,代表从左到右每个连续的长度为 $k$ 的区间的最小值。

第二行是 $n-k+1$ 个整数,代表从左到右每个连续的长度为 $k$ 的区间的最大值。

样例一

input

8 3
1 3 -1 -3 5 3 6 7

output

-1 -3 -3 -3 3 3
3 3 5 5 6 7

数据范围与约定

保证 $k \leq n$, 所有的数都在int的表示范围内。

题目以英文为准!

时间限制: $1\mathrm{s}$

内存限制: $256\mathrm{MB}$

来源

from POJ