摘要: Naive Operations Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 502768/502768 K (Java/Others)Total Submission(s): 1791 Accepted Submission(s): 7 阅读全文
posted @ 2018-07-26 23:21 RhythmLian 阅读(205) 评论(0) 推荐(0) 编辑
摘要: 操作说明: segtree<T>tree(len) =>创建一个内部元素类型为T、区间为1~len的线段树tree tree.build(l,r) =>以[l,r]区间建立线段树 tree.update(l,r,val,1,len) =>区间[l,r]所有元素加上val tree.query(l,r 阅读全文
posted @ 2018-07-26 17:15 RhythmLian 阅读(283) 评论(0) 推荐(1) 编辑
摘要: Hack It Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 548 Accepted Submission(s): 170Special Ju 阅读全文
posted @ 2018-07-26 12:39 RhythmLian 阅读(315) 评论(0) 推荐(0) 编辑