线段树
文章平均质量分 81
别哔哔好伐
安静的coder
展开
-
hdu 3308 线段树
LCIS Time Limit: 6000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 4082 Accepted Submission(s): 1842 Problem Description Given n integers. Yo原创 2014-08-08 14:54:40 · 449 阅读 · 0 评论 -
线段树
You are given circular array a0, a1, ..., an - 1. There are two types of operations with it: inc(lf, rg, v) — this operation increases each element on the segment [lf, rg] (inclusively) by v;rm原创 2014-07-04 08:25:22 · 440 阅读 · 0 评论 -
hdu 5023 线段树
A Corrupt Mayor's Performance ArtTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 100000/100000 K (Java/Others) Total Submission(s): 204 Accepted Submission(s): 100 Problem DescriptionCorr原创 2014-09-20 20:42:55 · 484 阅读 · 0 评论