数据结构-树链剖分
关注
分享
扫一扫
文章平均质量分 84
snowy_smile
终于在ICPC World Final里拿到了气球！
再努力一点吧，坚持下去吧，梦想是会实现的！ 人生会有低谷，但我更相信，未来也会有更多梦想能够实现~
展开
-
【Codeforces Round 326 (Div 2)E】【树链剖分】Duff in the Army 树上给定路径上编号最小的几个人
E. Duff in the Armytime limit per test4 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputRecently Duff has been a soldier in the a原创 2015-11-10 11:39:35 · 632 阅读 · 0 评论 -
【Educational Codeforces Round 3 E】【树链剖分】Minimum spanning tree for each edge 图构最小生成树，生成树必须包含第i条边
E. Minimum spanning tree for each edgetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputConnected undirected w原创 2015-12-23 20:20:51 · 1097 阅读 · 0 评论 -
模板【HDU5893 2016 ACM ICPC Asia Regional Shenyang Online B】【树链剖分 权在边上 链值合并 结构体写法】List wants to travel
List wants to travelTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 727 Accepted Submission(s): 179Problem DescriptionA boy nam原创 2016-09-22 10:10:01 · 511 阅读 · 0 评论