Create a Double Ended Queue , Qi that will store indexes of array elements The queue will store indexes of useful elements in every window and it will maintain decreasing order of values from front to rear in Qi , i . e . , arr [ Qi . front [ ] ] to arr [ Qi . rear ( ) ] are sorted in decreasing order
std :: deque < int > Qi ( k ) ;