HDU - 6319 Problem A. Ascending Rating （单调队列）

Problem A. Ascending Rating

Before the start of contest, there are nn ICPC contestants waiting in a long queue. They are labeled by 11 to nn from left to right. It can be easily found that the ii-th contestant's QodeForces rating is aiai. 
Little Q, the coach of Quailty Normal University, is bored to just watch them waiting in the queue. He starts to compare the rating of the contestants. He will pick a continous interval with length mm, say [l,l+m−1][l,l+m−1], and then inspect each contestant from left to right. Initially, he will write down two numbers maxrating=−1maxrating=−1 and count=0count=0. Everytime he meets a contestant kk with strictly higher rating than maxratingmaxrating, he will change maxratingmaxrating to akak and countcount to count+1count+1. 
Little T is also a coach waiting for the contest. He knows Little Q is not good at counting, so he is wondering what are the correct final value of maxratingmaxrating a