"Tree-shaped Array" POJ 2309 BST

#include <iostream> #include <cstdio> #include <cmath> #include <cstring> #include < algorithm> #include <stack> #include <queue> #include <vector>using namespace std;/** *  @ Author      johnsondu *  @time        2015-8-19 16:37 *  @type        Binary Index Tree  *  @key         try to Understand how to retrieve * the last              bit of a number which is 1. *  @url         http://poj.org/problem?id=2309 */i NT Main () {    int tcase;    int q;    scanf ("%d", &tcase);    while (Tcase-) {        scanf ("%d", &q);        int lowbit = Q & ((-Q);        printf ("%d%d\n", q-lowbit+1, q+lowbit-1);    }    return 0;}

Copyright NOTICE: This article for Bo Master original article, without Bo Master permission not reproduced.

"Tree-shaped Array" POJ 2309 BST