线段树 - 随笔分类 - ERKE

A simple simulation problem. hdu 4973

只有注册用户登录后才能阅读该文。

posted @ 2014-09-11 10:38 ERKE 阅读(3) 评论(0) 推荐(0)

Kingdom Inspection 线段树求组合数

只有注册用户登录后才能阅读该文。

posted @ 2014-08-27 00:27 ERKE 阅读(3) 评论(0) 推荐(0)

Successor hdu4366 树的线性序列+线段树

只有注册用户登录后才能阅读该文。

posted @ 2014-08-08 10:29 ERKE 阅读(2) 评论(0) 推荐(0)

Crayon 线段树或者树状数组

摘要：CrayonTime Limit:2000/1000MS (Java/Others)Memory Limit:128000/64000KB (Java/Others)SubmitStatusProblem DescriptionBackgroundMary love painting so much... 阅读全文

posted @ 2014-07-18 10:29 ERKE 阅读(394) 评论(0) 推荐(0)

Count Color 线段树

摘要：Count ColorTime Limit:1000MSMemory Limit:65536KB64bit IO Format:%I64d & %I64uSubmitStatusDescriptionChosen Problem Solving and Program design as an op... 阅读全文

posted @ 2014-07-14 19:31 ERKE 阅读(173) 评论(0) 推荐(0)

hdu 1542 线段树求矩形并

摘要：AtlantisTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5932Accepted Submission(s): 2599Problem DescriptionThere are several ancient Greek texts that contain descriptions of the fabled island Atlantis. Some of these texts eve... 阅读全文

posted @ 2014-02-27 13:47 ERKE 阅读(254) 评论(0) 推荐(0)

Huge Mission

摘要：Huge MissionProblem DescriptionOaiei is busy working with his graduation design recently. If he can not complete it before the end of the month, and he can not graduate! He will be very sad with that, and he needs your help. There are 24 hours a day, oaiei has different... 阅读全文

posted @ 2014-02-23 23:50 ERKE 阅读(182) 评论(0) 推荐(0)

hdu1698线段树的区间更新区间查询

摘要：Just a HookTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 13001Accepted Submission(s): 6476 Problem DescriptionIn the game of DotA, Pudge’s meat hook is actually the most horrible thing for most of the heroes. The hook is made up of several conse 阅读全文

posted @ 2013-08-14 13:02 ERKE 阅读(237) 评论(0) 推荐(0)

hdu1754线段树的单点更新区间查询

摘要：I Hate ItTime Limit: 9000/3000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 27606Accepted Submission(s): 10956 Problem Description很多学校流行一种比较的习惯。老师们很喜欢询问，从某某到某某当中，分数最高的是多少。这让很多学生很反感。不管你喜不喜欢，现在需要你做的是，就是按照老师的要求，写一个程序，模拟老师的询问。当然，老师有时候需要更新某位同学的成绩。Input本题目包含多组测试，请处理到文件结束阅读全文

posted @ 2013-08-14 12:56 ERKE 阅读(247) 评论(0) 推荐(0)

CodeForces 242E二维线段树

摘要：E. XOR on SegmentYou've got an array a, consisting of n integers a1, a2, ..., an. You are allowed to perform two operations on this array:Calculate the sum of current array elements on the segment [l, r], that is, count value al + al + 1 + ... + ar.Apply the xor operation with a given number x t 阅读全文

posted @ 2013-08-14 08:38 ERKE 阅读(319) 评论(0) 推荐(0)

随笔分类 - 线段树