kuronekonano的博客

The environment of Beijing is insufferable as you know.You have to wear a mask when you go outside because of the smog. Xiaoming is new here,he has to get accustomed to the lifestyle of beijing.So at ...

题目描述 作为白玉楼的庭师，妖梦虽然不会n刀流，但是却领悟了生命二刀流。然而我也是个剑的收藏者，家里屯着n把剑，每一把剑都有一个灵魂值a[i]，由于一些剑之间可能有共鸣，所以我需要两把契合度最高的剑。据妖梦所说，两把编号为i,j剑的契合度为a[i] and a[j]。如何深得剑的灵魂呢？(即求最大值)输入 第一行一个整数n，代表藏剑数。 第二行n个整数，第i个整数表示a[i]。输出 ...

[1597] Find MaxXorSum 时间限制: 2000 ms　内存限制: 65535 K 问题描述 Given n non-negative integers, you need to find two integers a and b that a xor b is maximum. xor is exclusive-or. 输入 Input starts with an i...

题目描述 Alice knows that Bob has a secret tree (in terms of graph theory) with n nodes with n − 1 weighted edges with integer values in [0, 260 −1]. She knows its structure but does not know the specific...