摘要：
Regular segment tree usage. Should be medium though.struct Node{ Node(int rs, int re) : s(rs), e(re), left(nullptr), right(nullptr){} int s;... 阅读全文
posted @ 2015-10-20 14:40
Tonix
阅读(196)
评论(0)
推荐(0)
摘要：
Similar one as LintCode "Data Stream Median".class MedianFinder { priority_queue hl; // max-heap priority_queue, std::greater > hr; // min-heapp... 阅读全文
posted @ 2015-10-20 14:05
Tonix
阅读(154)
评论(0)
推荐(0)
浙公网安备 33010602011771号