Implementation of Binary Indexed Tree

BIT.cpp

class BIT{
	int T[MAX], size;

	public:
	BIT(int n){
		size = n;
		for(int i=1; i<=n; i++)
			T[size] = 0;
	}
	int get(int i){
		int s = 0;
		while(i>0){ 
			s = s + T[i];
			i = i - (i&(-i));
		}
		return s;
	}

	void add(int i, int v){
		while(i<=size){
			T[i] = T[i] + v;
			i = i + (i&(-i));
		}
	}
};