ACM 树链剖分
青山绿水之辈
奋斗青春年华
展开
-
HDU 3966Aragorn's Story(树链剖分)点权更新模板
Aragorn's StoryTime Limit: 10000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4434 Accepted Submission(s): 1212Problem DescriptionOur protagoni原创 2015-05-06 12:54:06 · 767 阅读 · 0 评论 -
HDU5052 Yaoge’s maximum profit(树链剖分)点权更新,经典题
Yaoge’s maximum profitTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 662 Accepted Submission(s): 182Problem DescriptionYaoge li原创 2015-05-07 20:52:35 · 1338 阅读 · 0 评论 -
FZU 2082 过路费 (树链剖分)边权
Problem 2082 过路费Accept: 322 Submit: 1101Time Limit: 1000 mSec Memory Limit : 32768 KB Problem Description有n座城市,由n-1条路相连通,使得任意两座城市之间可达。每条路有过路费,要交过路费才能通过。每条路的过路费经常会更新,现问你,当前情况下,从城市原创 2015-05-07 22:49:41 · 783 阅读 · 0 评论 -
CSU 1607: Do You Have The Template?(树链剖分)边权
1607: Do You Have The Template?Time Limit: 7 Sec Memory Limit: 128 MBSubmit: 112 Solved: 8[Submit][Status][Web Board]DescriptionThere is a tree with N vertices, each edges have a p原创 2015-05-06 02:06:10 · 1011 阅读 · 0 评论 -
HDU5274 Dylans loves tree(树链剖分)很巧的点权更新
Dylans loves treeAccepts: 49Submissions: 262Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 131072/131072 K (Java/Others)问题描述Dylans有一棵N个点的树。每个点有点权。树上节点标号为1∼N。他得到了Q个询问,原创 2015-06-21 09:50:03 · 1585 阅读 · 0 评论 -
CSU 1663: Tree(树链剖分)
1663: TreeTime Limit: 5 Sec Memory Limit: 128 MBSubmit: 26 Solved: 11[Submit][Status][Web Board]DescriptionCSU has a lot of trees. But there is a tree which is different from the oth原创 2015-06-22 17:20:17 · 695 阅读 · 0 评论