영어 원문입니다. 원문의 수식·표를 글자로 옮겨 모양이 다를 수 있습니다. 정확한 내용은 원문 페이지에서 확인하세요. 원문 페이지 열기 (새 창)
시간 제한 1초 · 메모리 제한 512 MB
Problem
A fence consists of n vertical boards. The width of each board is 1 and their heights may vary.
You want to attach a rectangular advertisement to the fence. Your task is to calculate the maximum area of such an advertisement in each window of k vertical boards, from left to right.
Input
The first line contains two integers n and k: the width of the fence and the size of the window.
After this, there are n integers x_1, x_2, …, x_n: the height of each board.
Output
Print n - k + 1 integers: the maximum areas of the advertisements.
Constraints
- 1 ≤ k ≤ n ≤ 2 · 10^5
- 1 ≤ x_i ≤ 10^9
예제
예제 1
8 3 4 1 5 3 3 2 4 1
5 6 9 6 6 4