摘要:
The Company Dynamic Rankings has developed a new kind of computer that is no longer satisfied with the query like to simply find the k-th smallest num 阅读全文
posted @ 2016-12-26 22:57
keshuqi
阅读(202)
评论(0)
推荐(0)
摘要:
部分内容引自myt论文:树状数组延伸和离线优化(CDQ、整体二分和莫队) 大致思路 1.确定答案范围[L,R],mid=L+R>>1;2.算出答案在[L,mid]内的操作对答案在[mid+1,R]内的操作的贡献;3.将答案在[L,mid]内的操作放入队列Q1,solve(Q1,L,mid)将答案在[ 阅读全文
posted @ 2016-12-26 20:41
keshuqi
阅读(287)
评论(0)
推荐(0)

浙公网安备 33010602011771号