2017年7月11日
[Codeforces]817F. MEX Queries 离散化+线段树维护
摘要： You are given a set of integer numbers, initially it is empty. You should perform n queries. There are three different types of queries: 1 l r — Add all missing numbers from the interval [l, r] 2 l r — Remo 阅读全文
posted @ 2017-07-11 15:25 Deadecho 阅读(797) 评论(3) 推荐(2) 编辑