BST - POJ 2309 水题
来源:互联网 发布:tc编程官网 编辑:程序博客网 时间:2024/05/24 11:14
BST
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8519 Accepted: 5158
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
2810
Sample Output
1 159 11
题意:以某个点为根节点的子树的最左右子节点各是多少。
思路:就是用到了树状数组的思想。
AC代码如下:
#include<cstdio>#include<cstring>using namespace std;typedef long long ll;ll lowbit(ll x){ return x&(-x);}int main(){ ll t,n,i,j,k; scanf("%I64d",&t); while(t--) { scanf("%I64d",&n); k=lowbit(n); printf("%I64d %I64d\n",n-k+1,n+k-1); }}
0 0
- BST - POJ 2309 水题
- poj 2309 BST (^ ^)
- POJ 2309 BST
- poj 2309 BST
- POJ 2309 BST
- POJ 2309 BST
- POJ 2309 BST
- poj 2309 BST(lowbit)
- POJ 2309 BST
- poj 2309 BST
- POJ 2309:BST lowbit
- poj 2309 BST
- POJ 2309 BST
- Poj 2309 BST
- POJ 2309 BST
- POJ 2309 BST
- POJ 2309 BST
- poj 2309 BST(水)
- 备份IIS httpd.ini 重写规则,兼容大部分版本IIS服务器
- Oracle高级应用之物化视图(materialized view)
- 用例设计:功能模块和专题的抉择?
- play的安装
- ScrollView嵌套GridView的情况
- BST - POJ 2309 水题
- POJ 1417 True Liars(并查集+DP)
- BRIEF code
- webstorm安装expressjs
- Java 二分法查找
- Mnemonics and Palindromes 3 - URAL 1737 水题
- 设计模式---原型模式
- 返回当前设备上安装的应用包集合
- UVA 1160 - X-Plosives(并查集)