zoukankan      html  css  js  c++  java
  • POJ2309BST(树状数组)

    BST
    Time Limit: 1000MS   Memory Limit: 65536K
    Total Submissions: 9182   Accepted: 5613

    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 <= 231 - 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

     

    强大的lowbit,树状数组太神奇了

     1 #include<cstdio>
     2 #include<cstring>
     3 #include<iostream>
     4 using namespace std;
     5 int lowbit(int k)
     6 {
     7     return k & (-k);
     8 }
     9 int main()
    10 {
    11     int t,x;
    12     scanf("%d", &t);
    13     while(t--)
    14     {
    15         scanf("%d", &x);
    16         printf("%d %d
    ",x - lowbit(x) + 1, x + lowbit(x) - 1);
    17     }
    18     return 0;
    19 }
    View Code
  • 相关阅读:
    线程同步-使用CountDownEvent类
    WPF 依赖属性和附加属性
    ef core
    Razor语法
    python-爬虫
    ftp
    泛型
    结对编程作业
    第三次作业
    第二次作业
  • 原文地址:https://www.cnblogs.com/zhaopAC/p/4984779.html
Copyright © 2011-2022 走看看