随笔分类 -  数据结构---线段树

(lazy标记，区间修改与查询) A - A Simple Problem with Integers
摘要：A - A Simple Problem with Integers "C a b c" means adding c to each of Aa, Aa+1, ... , Ab. -10000 ≤ c ≤ 10000."Q a b" means querying the sum of Aa, Aa 阅读全文
posted @ 2019-01-21 16:43 liuyongliu 阅读(173) 评论(0) 推荐(0) 编辑
线段树
摘要：浅谈线段树 线段树详解(非递归实现) 线段树与树状数组的区别,作者：闵梓轩 demo /***********************************************/ int n,a[maxn+2],m; struct node{ int l,r; int h; }tree[4*m 阅读全文
posted @ 2019-01-20 16:47 liuyongliu 阅读(118) 评论(0) 推荐(0) 编辑

点击右上角即可分享
微信分享提示