树状数组

#define lowbit(x) (x&(-x))

int const maxn=3333;
int tree[maxn],n;

void add(int p,int val)
{
	while(p<=n)
	{
		tree[p]+=val;
		p+=lowbit(p);
	}
}

int getsum(int p)
{
	int sum=0;
	while(p>0)
	{
		sum+=tree[p];
		p-=lowbit(p);
	}
	return sum;
}