![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
线段树
文章平均质量分 85
shyoldman
lalala~~~
展开
-
线段树入门&lazy思想
转自:点击打开链接线段树将区间分成若干个子区间,子区间又继续分,直到区间为一个点(区间左值等于右值)对于父区间[a,b],其子区间为[a,(a+b)/2]和[(a+b)/2+1,b] 用于求区间的值,如区间最值、区间的和等。代码实现中,约定结点下标从1开始,所以某结点下标为x,那么左儿子下标为2x,右儿子下标为2x+1,父结点下标为x/2。转载 2017-11-07 18:07:25 · 228 阅读 · 0 评论 -
HDU 1166 敌兵布阵
敌兵布阵Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 101984 Accepted Submission(s): 43095Problem DescriptionC国的死对头A国这段时间正在进行军事原创 2017-11-02 21:40:00 · 3772 阅读 · 1 评论 -
HDU 1698 Just a Hook
Just a HookTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 36260 Accepted Submission(s): 17682Problem DescriptionIn the game原创 2017-11-03 21:13:23 · 193 阅读 · 0 评论