【ECJTU_ACM 11级队员2012年暑假训练赛（7） - B - Sliding Window】

最新推荐文章于 2021-07-29 16:00:21 发布

转载最新推荐文章于 2021-07-29 16:00:21 发布 · 111 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/ismdeep/archive/2012/08/05/2624396.html

探讨了在一个大小为n的数组中，如何确定不同位置下大小为k的滑动窗口内的最大值与最小值。提供了样例输入输出，帮助理解问题及解决方案。

B - Sliding Window

Time Limit:12000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u

Submit Status Practice POJ 2823

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 nintegers 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

========================================================================================================================================================


这题不会啊。。。。慢慢继续想。。

转载于:https://www.cnblogs.com/ismdeep/archive/2012/08/05/2624396.html