问题描述 Queues and Priority Queues are data structures which are known to most computer scientists. The Team Queue, however, is not so well known, though
问题描述有一个长为 $n$ 的序列 $a$,以及一个大小为 $k$ 的窗口。现在这个从左边开始向右滑动,每次滑动一个单位,求出每次滑动后窗口中的最大值和最小值。例如:The array is $[1,3,-1,-3,5,3,6,7]$, and $k = 3$。输入格式输入一共有两行,第一行有两个正