POJ_2823 Sliding Window

最新推荐文章于 2021-04-07 16:12:43 发布

原创

最新推荐文章于 2021-04-07 16:12:43 发布 · 201 阅读

0 ·

CC 4.0 BY-SA版权

Sliding Window

链接

POJ_2823 Sliding Window
Luogu_1886 滑动窗口 /【模板】单调队列（本题的弱化版）

Description

An array of size $n ≤ 10^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$ .

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.

题目大意：有一个长为 $n$ 的序列 $a$ ，以及一个大小为 $k$ 的窗口。现在这个从左边开始向右滑动，每次滑动一个单位，求出每次滑动后窗口中的最大值和最小值。

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.