MCPcopy Create free account
hub / github.com/SuprDewd/CompetitiveProgramming / mn

Method mn

code/data-structures/monotonic_queue.cpp:7–7  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

5 M.push(M.empty() ? x : min(M.top(), x)); }
6 int top() { return S.top(); }
7 int mn() { return M.top(); }
8 void pop() { S.pop(); M.pop(); }
9 bool empty() { return S.empty(); } };
10struct min_queue {

Callers 1

mnMethod · 0.45

Calls 1

topMethod · 0.45

Tested by

no test coverage detected