给定一棵有N个节点的树，每个边都有一个整数值。定义dist(a, b)为从节点a到节点b路径上边的值之和。初始所有节点为白色。操作包括改变节点颜色或询问两个都为白色的节点的最大dist值。当没有白色节点时，输出'They have disappeared.'。"
109006802,9607122,Linux环境下配置Java开发环境,"['Linux', 'Java', 'JDK']
Description
You are given a tree (an acyclic undirected connected graph) with N nodes, and nodes numbered 1,2,3...,N. Each edge has an integer value assigned to it(note that the value can be negative). Each node has a color, white or black. We define dist(a, b) as the sum of the value of the edges on the path from node a to node b.
All the nodes are white initially.
We will ask you to perfrom some instructions of the following form:
- C a : change the color of node a.(from black to white or from white to black)
- A : ask for the maximum dist(a, b), both of node a and node b must be white(a can be equal to b). Obviously, as long as there is a white node, the result will alway be non negative.
Input
- In the first line there is an integer N (N <= 100000)
- In the next N-1 lines, the i-th line describes the i-th edge: a line with three integers a b c denotes an edge between a, b of value c (-1000 <= c <= 1000)
- In the next line, there is an integer Q denotes the number of i
最低0.47元/天 解锁文章
扫一扫
156
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
