POJ2309BST【树状数组的理解】

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;

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

int main() {
int n;
int t;
scanf("%d",&t);
while(t--) {
scanf("%d",&n);
int n1 = n - lowbit(n);
printf("%d", n1 + 1);
int n2 = n + lowbit(n);
printf(" %d\n", n2 - 1);
}
}