The xor-longest Path（01字典树—求树上连续区间的最大异或值）

最新推荐文章于 2022-12-08 09:53:44 发布

sdau_blue

最新推荐文章于 2022-12-08 09:53:44 发布

阅读量754

点赞数

分类专栏：数据结构——字典树各类板子

本文链接：https://blog.csdn.net/xianpingping/article/details/83108065

版权

The xor-longest Path

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 10003		Accepted: 2029

Description

In an edge-weighted tree, the xor-length of a path p is defined as the xor sum of the weights of edges on p:

$_{xor}length(p)=\oplus_{e \in p}w(e)$

⊕ is the xor operator.

We say a path the xor-longest path if it has the largest xor-length. Given an edge-weighted tree with n nodes, can you find the xor-longest path? 　

Input

The input contains several test cases. The first line of each test case contains an integer n(1<=n<=100000), The following n-1

确定要放弃本次机会？

福利倒计时

: :

立减 ¥

普通VIP年卡可用

关注关注