
技巧
衛宮
I will be back
展开
-
poj2566 Bound Found
DescriptionSignals of most probably extra-terrestrial origin have been received and digitalized by The Aeronautic and Space Administration (that must be going through a defiant phase: "But I want to u...原创 2018-04-24 11:45:58 · 185 阅读 · 0 评论 -
poi 2182 2828 树状数组倍增查询
这种题的主要目的是找位置, 比如第一个前缀和等于k的位置,1. 可以用树状数组 + 二分, 时间为logn * logn, 这样时间稍微慢了些;2. 用倍增法这片博文写得很好, http://www.hawstein.com/posts/binary-indexed-trees.htmlint getKPos(int k){ int bitMask = bthPow[upper_b...原创 2018-06-19 21:44:40 · 532 阅读 · 0 评论