大家好，又见面了，我是全栈君。
| Time Limit: 1000MS | Memory Limit: 65536KB | 64bit IO Format: %lld & %llu |
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
31 – 1).
31 – 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
Source
POJ Monthly,Minkerui
用树状数组的lowbit处理即可。(x&-x)可以取出x二进制表示下的最后一个1，即可知x的管辖半径。
1 /*by SilverN*/ 2 #include<algorithm> 3 #include<iostream> 4 #include<cstring> 5 #include<cstdio> 6 #include<cmath> 7 using namespace std; 8 int read(){ 9 int x=0,f=1;char ch=getchar(); 10 while(ch<'0' || ch>'9'){ if(ch=='-')f=-1;ch=getchar();} 11 while(ch>='0' && ch<='9'){x=x*10+ch-'0';ch=getchar();} 12 return x*f; 13 } 14 int lowbit(int x){ return x&-x;} 15 int T; 16 int n; 17 int main(){ 18 T=read(); 19 while(T--){ 20 n=read(); 21 printf("%d %d\n",n-lowbit(n)+1,n+lowbit(n)-1); 22 } 23 return 0; 24 }
转载于:https://www.cnblogs.com/SilverNebula/p/5889498.html
版权声明：本文内容由互联网用户自发贡献，该文观点仅代表作者本人。本站仅提供信息存储空间服务，不拥有所有权，不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容， 请联系我们举报，一经查实，本站将立刻删除。
发布者：全栈程序员-站长，转载请注明出处：https://javaforall.net/108872.html原文链接：https://javaforall.net
