2014年11月27日
[POJ] 3468 A Simple Problem with Integers [线段树区间更新求和]
摘要： A Simple Problem with IntegersDescriptionYou haveNintegers,A1,A2, ... ,AN. You need to deal with two kinds of operations. One type of operation is to ... 阅读全文
posted @ 2014-11-27 11:10 SXISZERO 阅读(193) 评论(0) 推荐(0) 编辑
[POJ] 2352 Stars [线段树区间求和]
摘要： StarsDescriptionAstronomers often examine star maps where stars are represented by points on a plane and each star has Cartesian coordinates. Let the ... 阅读全文
posted @ 2014-11-27 11:06 SXISZERO 阅读(130) 评论(0) 推荐(0) 编辑
[HDU] 1698 Just a Hook [线段树区间替换]
摘要： Just a HookTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 18378Accepted Submission(s): 9213Proble... 阅读全文
posted @ 2014-11-27 10:59 SXISZERO 阅读(220) 评论(0) 推荐(0) 编辑
[HDU] 2795 Billboard [线段树区间求最值]
摘要： BillboardTime Limit: 20000/8000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11861Accepted Submission(s): 5223Problem... 阅读全文
posted @ 2014-11-27 10:56 SXISZERO 阅读(178) 评论(0) 推荐(0) 编辑
[HDU] 1394 Minimum Inversion Number [线段树求逆序数]
摘要： Minimum Inversion NumberTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 11788Accepted Submission(s... 阅读全文
posted @ 2014-11-27 10:52 SXISZERO 阅读(177) 评论(0) 推荐(0) 编辑