Hello codeforces! ↵
↵
Recently in the problem I came across with this data structure, which can perform this operations:↵
↵
- add element↵
↵
- delete element↵
↵
- return the maximal of it↵
↵
with O(1) for query.↵
↵
So the question is simple: is it exist?
↵
Recently in the problem I came across with this data structure, which can perform this operations:↵
↵
- add element↵
↵
- delete element↵
↵
- return the maximal of it↵
↵
with O(1) for query.↵
↵
So the question is simple: is it exist?