POJ 2309 BST （树状数组）

最新推荐文章于 2017-04-07 21:42:27 发布

sxk_sxy

最新推荐文章于 2017-04-07 21:42:27 发布

阅读量795

点赞数

分类专栏：树状数组

本文链接：https://blog.csdn.net/u013446688/article/details/38235623

版权

树状数组专栏收录该内容

13 篇文章 0 订阅

订阅专栏

BST

Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u

Submit Status

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

超水的题一道~~~

题意：如题中的所给的树，给你任意一个节点，求该节点的根节点。

心得：开始诈一看，愣是没敢做，还以为多难呢。唉，水神啊。。。后来仔细一看，唉，太水了，这棵树不刚好符合树状数组的树状图吗，唉，好聪明有木有^_^~~~

分析：分析出来树状图符合树状数组就好办了，直接用强大的lowbit（），直接用x&（-x）就求出来x的下标了。

AC代码：

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <cmath>
#include <cstdlib>
#include <ctime>
#define INF 0x7fffffff
using namespace std;
const int maxn = 1000 + 10;

int lowbit(int x)
{
    return x & (-x);
}

int main()
{
    int n,x;
    while(scanf("%d",&n)!=EOF)
    {
        while(n--)
        {
            scanf("%d",&x);
            printf("%d %d\n",x-(lowbit(x)-1),x+(lowbit(x)-1));
        }
    }
    return 0;
}