Poj 2309 BST

Poj 2309 BST

题意：So easy的树状数组
解析：使用lowbit即可

#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
using namespace std;
int n;
long long lowbit(long long a)
{return a&(-a);
}
int main()
{scanf("%d",&n);while(n--){long  long x;scanf("%lld",&x);printf("%lld %lldn",x-lowbit(x)+1,x+lowbit(x)-1);}return 0;
}