BST POJ - 2309 思维题
2024-08-26 11:55:52
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).
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 https://blog.csdn.net/fengkuangdewoniudada/article/details/69660755
规律请看这篇博客
#include <cstdio>
#include <cstring>
#include <queue>
#include <cmath>
#include <algorithm>
#include <set>
#include <iostream>
#include <map>
#include <stack>
#include <string>
#include <vector>
#define pi acos(-1.0)
#define eps 1e-6
#define fi first
#define se second
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define bug printf("******\n")
#define mem(a,b) memset(a,b,sizeof(a))
#define fuck(x) cout<<"["<<x<<"]"<<endl
#define f(a) a*a
#define sf(n) scanf("%d", &n)
#define sff(a,b) scanf("%d %d", &a, &b)
#define sfff(a,b,c) scanf("%d %d %d", &a, &b, &c)
#define pf printf
#define FRE(i,a,b) for(i = a; i <= b; i++)
#define FREE(i,a,b) for(i = a; i >= b; i--)
#define FRL(i,a,b) for(i = a; i < b; i++)
#define FRLL(i,a,b) for(i = a; i > b; i--)
#define FIN freopen("DATA.txt","r",stdin)
#define lowbit(x) x&-x
#pragma comment (linker,"/STACK:102400000,102400000") using namespace std;
typedef long long LL; int main() {
int t, n;
scanf("%d", &t);
while(t--) {
scanf("%d", &n);
int k=lowbit(n);
printf("%d %d\n",n-k+,n+k-);
}
return ;
}
最新文章
- “LC.exe”错误
- (转)JS Date格式化为yyyy-MM-dd类字符串
- 简单实用的PHP防注入类实例
- GridView使用自带分页功能时分页方式及样式PagerStyle
- Page和UserControl的事件加载顺序
- sql 去除重复记录
- ImagXpress中如何修改Alpha通道方法汇总
- FZU 8月有奖月赛A Daxia &; Wzc&#39;s problem (Lucas)
- 解析搜狗词库(python)
- Spring初学(一)
- 使用更清晰DebugLog开发和调试工具
- document.form.command.value
- 学习笔记TF035:实现基于LSTM语言模型
- 【移动开发】Service类onStartCommand()返回值和参数
- 浅谈C++中的友元关系
- 《java入门第一季》之泛型方法和泛型接口
- number类型精度分析
- 小技巧——病毒分析中关闭ASLR
- Wireshark&#160;wireshake数据包分割及捕包过滤器介绍
- [CF1017G]The Tree[树链剖分+线段树]