Maximum sliding window

10.cpp

// Using deque
void max_slid_window(vector<int> v){
  deque<int> q;
  for(int i=0; i<k; i++){
    while(!q.empty() && v[i] >= v[q.back()])
      q.pop_back();
    q.push_back(i);
  }
  
  for(int i=k+1; i<n; i++){
    cout << v[q.front()] << " ";
    while(!q.empty() && q.front() >= (i-k))
      q.pop_front();
    while(!q.empty() && v[i] >= v[q.back()])
      q.pop_back();
    q.push_back(i);
  }
  cout << v[q.front()] << endl;
}