数据结构
文章平均质量分 79
Clearle
我就是要证明给你看!
展开
-
线段树练习
rt表示当前结点PushUp(int rt)是把当前结点的信息更新到父结点PushUp(int rt)是把当前结点的信息更新给儿子结点单点更新:更新子节点,用PushUp(int rt)函数不断向上传递hdu 1166 敌兵布阵 Time Limit: 2000/100原创 2013-04-23 17:54:26 · 515 阅读 · 0 评论 -
POJ 2991 Crane 线段树+计算几何 出自“挑战程序设计竞赛”
CraneTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 3025 Accepted: 810 Special JudgeDescriptionACM has bought a new crane (crane -- jeřáb) . The cr转载 2014-05-16 09:04:44 · 1003 阅读 · 0 评论 -
HDU 4893 Wow! Such Sequence! 线段树
Wow! Such Sequence!Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1455 Accepted Submission(s): 458Problem DescriptionRecent原创 2014-07-30 11:54:29 · 466 阅读 · 0 评论 -
树链剖分
转自 http://blog.sina.com.cn/s/blog_6974c8b20100zc61.html“在一棵树上进行路径的修改、求极值、求和”乍一看只要线段树就能轻松解决,实际上,仅凭线段树是不能搞定它的。我们需要用到一种貌似高级的复杂算法——树链剖分。 树链,就是树上的路径。剖分,就是把路径分类为重链和轻链。 记siz[v]表示以v为根的子转载 2014-08-04 20:25:05 · 389 阅读 · 0 评论 -
CodeForces - 369E Valera and Queries 离线+树状数组
Valera and Queriestime limit per test2 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputValera loves segments. He has recently c原创 2014-09-04 16:13:02 · 765 阅读 · 0 评论 -
Codeforces Round #261 (Div. 2) D. Pashmak and Parmida's problem 离散化+树状数组
Pashmak and Parmida's problemtime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputParmida is a clever girl and原创 2014-09-26 20:29:31 · 543 阅读 · 0 评论 -
HDU 3874 Necklace 离线+树状数组
NecklaceTime Limit: 15000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3103 Accepted Submission(s): 1063Problem DescriptionMery has a beaut原创 2014-09-03 14:19:17 · 440 阅读 · 0 评论