Scribd
Upload
20 views2 pages

Monotonic Queue

Queue

Uploaded by

kalindalamadhupriya
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
20 views2 pages

Monotonic Queue

Queue

Uploaded by

kalindalamadhupriya
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
You are on page 1/ 2

#include <bits/stdc++.

h>

using namespace std;

/**
* Monotonic queue to keep track of the minimum and/or the maximum
* elements so far in the queue in O(1).
*/
template<class T>
class monotonic_queue {
queue<T> qu;
deque<T> mx, mn;

public:
/**
* Pushes a new element to the end of this queue.
*
* @param v the new element to be pushed.
*/
void push(T v) {
qu.push(v);
while (mx.size() && mx.back() < v) mx.pop_back();
mx.push_back(v);
while (mn.size() && mn.back() > v) mn.pop_back();
mn.push_back(v);
}

/**
* Pops the front element from the queue.
* If the queue is empty, an exception is thrown.
*/
void pop() {
if (mx.front() == qu.front()) mx.pop_front();
if (mn.front() == qu.front()) mn.pop_front();
qu.pop();
}

/**
* @return the front element of the queue.
*/
T front() const {
return qu.front();
}

/**
* @return the maximum element of the queue.
*/
T max() const {
return mx.front();
}

/**
* @return the minimum element of the queue.
*/
T min() const {
return mn.front();
}

/**
* @return the size of the queue.
*/
size_t size() const {
return qu.size();
}
};

You might also like