树状数组c++/java版

class Bit{
private:
    int n;
    vector<int> tree;
public:
    Bit(int _n):
        n(_n),tree(_n+1) {}
    int lowbit(int x){
        return x&(-x);
    }
    void add(int x){
        for(int i=x;i<=n;i+=lowbit(i)) tree[i] += 1;
    }
    int query(int x){
        int ans = 0;
        for(int i=x;i;i-=lowbit(i)) ans += tree[i];
        return ans;
    }
    void print(){
        for(int i=1;i<=n;i++) cout << tree[i] << " ";
        cout << endl;
    }
    
};

class BIT {
    private int[] tree;
    private int n;

    public BIT(int n) {
        this.n = n;
        this.tree = new int[n + 1];
    }

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

    public int query(int x) {
        int ret = 0;
        while (x != 0) {
            ret += tree[x];
            x -= lowbit(x);
        }
        return ret;
    }

    public void add(int x) {
        while (x <= n) {
            ++tree[x];
            x += lowbit(x);
        }
    }
}