Subsegments
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
Programmer Sasha has recently begun to study data structures. His coach Stas told him to solve the problem of finding a minimum on the segment of the array in , which Sasha coped with. For Sasha not to think that he had learned all, Stas gave him a new task. For each segment of the fixed length Sasha must find the maximum element of those that occur on the given segment exactly once. Help Sasha solve this problem.
Input
The first line contains two positive integers n and k (1 ≤ n ≤ 105, 1 ≤ k ≤ n) — the number of array elements and the length of the segment.
最低0.47元/天 解锁文章
1418
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
