link cut tree
关注
分享
扫一扫
Jogging_Clown
丢掉盔甲，我依然是骄傲帅气的骑士。
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
CodeForces 题目191C. Fools and Roads（Link Cut Tree，边权加求边权值）
C. Fools and Roadstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThey say that Berland has exactly two prob原创 2015-08-21 22:00:06 · 1096 阅读 · 0 评论 -
URAL 题目1553. Caves and Tunnels（Link Cut Tree 修改点权，求两点之间最大）
1553. Caves and TunnelsTime limit: 3.0 secondMemory limit: 64 MBAfter landing on Mars surface, scientists found a strange system of caves connected by tunnels. So they began to research原创 2015-08-19 10:32:24 · 1067 阅读 · 0 评论 -
BZOJ 题目1036: [ZJOI2008]树的统计Count（Link Cut Tree，修改点权求两个最大值和最大值）
1036: [ZJOI2008]树的统计CountTime Limit: 10 Sec Memory Limit: 162 MBSubmit: 8421 Solved: 3439[Submit][Status][Discuss]Description一棵树上有n个节点，编号分别为1到n，每个节点都有一个权值w。我们将以下面的形式来要求你对这棵树完成一些操作： I. CH原创 2015-08-18 21:20:22 · 725 阅读 · 0 评论 -
BZOJ 题目2002: [Hnoi2010]Bounce 弹飞绵羊（link cut tree）
2002: [Hnoi2010]Bounce 弹飞绵羊Time Limit: 10 Sec Memory Limit: 259 MBSubmit: 5421 Solved: 2863[Submit][Status][Discuss]Description某天，Lostmonkey发明了一种超级弹力装置，为了在他的绵羊朋友面前显摆，他邀请小绵羊一起玩个游戏。游戏一开始，L原创 2015-08-17 21:39:20 · 686 阅读 · 0 评论 -
SPOJ 题目375 Query on a tree（link cut tree边权更新，求两点最大值）
QTREE - Query on a treeno tags You are given a tree (an acyclic undirected connected graph) with N nodes, and edges numbered 1, 2, 3...N-1.We will ask you to perfrom some instructions原创 2015-08-17 18:44:11 · 972 阅读 · 0 评论 -
FOJ题目Problem 2082 过路费 （link cut tree边权更新）
Problem 2082 过路费 Accept: 382 Submit: 1279Time Limit: 1000 mSec Memory Limit : 32768 KB Problem Description有n座城市，由n-1条路相连通，使得任意两座城市之间可达。每条路有过路费，要交过路费才能通过。每条路的过路费经常会更新，现问你，当前情况下，从城市a原创 2015-08-17 18:17:11 · 880 阅读 · 0 评论 -
HDOJ 题目2475 Box（link cut tree去点找祖先）
BoxTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2374 Accepted Submission(s): 718Problem DescriptionThere are N boxes on t原创 2015-08-17 09:35:00 · 1061 阅读 · 0 评论 -
BZOJ 题目2049: [Sdoi2008]Cave 洞穴勘测（link cut tree）
2049: [Sdoi2008]Cave 洞穴勘测Time Limit: 10 Sec Memory Limit: 259 MBSubmit: 4698 Solved: 2107[Submit][Status][Discuss]Description辉辉热衷于洞穴勘测。某天，他按照地图来到了一片被标记为JSZX的洞穴群地区。经过初步勘测，辉辉发现这片区域由n个洞穴（分别原创 2015-08-16 01:19:38 · 811 阅读 · 0 评论 -
HDOJ 题目4010 Query on The Trees（Link Cut Tree连接，删边，路径点权加，路径点权最大值）
Query on The TreesTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 3602 Accepted Submission(s): 1587Problem DescriptionWe have me原创 2015-08-28 01:48:29 · 1545 阅读 · 0 评论 -
SPOJ 题目913QTREE2 - Query on a tree II（Link Cut Tree 查询路径第k个点）
QTREE2 - Query on a tree IIno tags You are given a tree (an undirected acyclic connected graph) with N nodes, and edges numbered 1, 2, 3...N-1. Each edge has an integer value assigned原创 2015-08-27 01:16:26 · 1673 阅读 · 0 评论 -
HDOJ 题目3966 Aragorn's Story（Link Cut Tree成段加减点权，查询点权）
Aragorn's StoryTime Limit: 10000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5505 Accepted Submission(s): 1441Problem DescriptionOur protagoni原创 2015-08-25 21:18:03 · 629 阅读 · 0 评论 -
HDOJ 题目2763 Housewife Wind（Link Cut Tree修改边权，查询两点间距离）
Housewife WindTime Limit: 4000MS Memory Limit: 65536KTotal Submissions: 7639 Accepted: 1990DescriptionAfter their royal wedding, Jiajia and Wind hid away in XX Vill原创 2015-08-25 22:11:27 · 760 阅读 · 0 评论 -
POJ 题目3237 Tree（Link Cut Tree边权变相反数，求两点最大值）
TreeTime Limit: 5000MS Memory Limit: 131072KTotal Submissions: 6131 Accepted: 1682DescriptionYou are given a tree with N nodes. The tree’s nodes are numbered 1 th原创 2015-08-20 21:08:19 · 731 阅读 · 0 评论