CSES - Sliding Window Median
Xem dạng PDF
Gửi bài giải
Điểm:
1,00 (OI)
Giới hạn thời gian:
1.0s
Giới hạn bộ nhớ:
512M
Input:
stdin
Output:
stdout
Nguồn bài:
Dạng bài
Ngôn ngữ cho phép
C, C++, Java, Kotlin, Pascal, PyPy, Python, Scratch
You are given an array of ~n~ integers. Your task is to calculate the median of each window of ~k~ elements, from left to right.
The median is the middle element when the elements are sorted. If the number of elements is even, there are two possible medians and we assume that the median is the smaller of them.
Input
- The first line contains two integers ~n~ and ~k~: the number of elements and the size of the window.
Then there are ~n~ integers ~x\_1,x\_2,\ldots,x\_n~: the contents of the array.
Output
- Print ~n-k+1~ values: the medians.
Constraints
- ~1 \le k \le n \le 2 \cdot 10^5~
- ~1 \le x\_i \le 10^9~
Example Input
8 3
2 4 3 5 8 1 2 1
Example Output
3 4 5 5 2 1
Bình luận