POJ2309 BST(树状数组)

BST

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 9098		Accepted: 5552

Description

Consider an infinite full binary search tree (see the figure below), the numbers in the nodes are 1, 2, 3, .... In a subtree whose root node is X, we can get the minimum number in this subtree by repeating going down the left node until the last level, and we can also find the maximum number by going down the right node. Now you are given some queries as "What are the minimum and maximum numbers in the subtree whose root node is X?" Please try to find answers for there queries. 

Input

In the input, the first line contains an integer N, which represents the number of queries. In the next N lines, each contains a number representing a subtree with root number X (1 <= X <= 2³¹ - 1).

Output

There are N lines in total, the i-th of which contains the answer for the i-th query.

Sample Input

2
8
10

Sample Output

1 15
9 11

给你n个数字，每个数字为根构成题目所示的树，输出每棵树的最小值和最大值。

lowbit函数的应用，二进制中最靠后1和0组成的数字。对以x为根的子树上的所有结点编号除lowbit那一位均与x相同。不在该子树上结

点的编号的最高位均与x不同。

AC代码：

#include "iostream"
#include "cstdio"
#include "cstring"
#include "algorithm"
using namespace std;
int n, x;
int lowbit(int x)
{
	return x & (-x);
}
int main(int argc, char const *argv[])
{
	scanf("%d", &n);
	while(n--) {
		scanf("%d", &x);
		printf("%d %d\n", x - lowbit(x) + 1, x + lowbit(x) - 1);
	}
	return 0;
}