Strongest fighter intuition

#1

how do i solve this problem in linear time?

#2

you can solve it using the windowing technique(consider a window of size k at every point) and find max in each window