树状数组 （前缀和维护 | 区间查询 | 单点修改 ）

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
static const int MAXN = (int)(1e3);
typedef long long int llong;
typedef struct TreeArr{
	int Depth;
	int N;
	int RawArr[MAXN+1];
	int T[MAXN+1];
} TreeArr,*ptrToTreeArr;
static inline int LowBit(int n){return n&-n;}

static void Convert(ptrToTreeArr const tp)
{
	memset(tp->T,0,sizeof(tp->T));
	register int i,j;
	for(i =1;i <= tp->N;++i)
		for(j = i-LowBit(i)+1;j <= i;++j)
			tp->T[i]+=tp->RawArr[j];
	tp->Depth = (int)log((double)tp->N)/log(2.0)+1;
}

static void _Convert(ptrToTreeArr const tp)
{
	memset(tp->T,0,sizeof(tp->T));
	register int i;int p;
	for(i = 1;i < tp->N;++i)
	{
		tp->T[i+LowBit(i)]+=tp->T[i];
		tp->T[i]+=tp->RawArr[i];
	}
	tp->T[i]+=tp->RawArr[i];
}
static void SingMod(ptrToTreeArr const tp,int p,int x)
{
	tp->RawArr[p]+=x;
	for(;p<tp->N;p+=LowBit(p))tp->T[p]+=x;
}
static llong PrefSum(const ptrToTreeArr tp,int p)
{
	llong pref = 0;
	for(;p;pref+=tp->T[p],p-=LowBit(p));
	return pref;
}
static llong RegQuery(const ptrToTreeArr tp,int Lft,int Rght)
{
	return PrefSum(tp,Rght)-PrefSum(tp,Lft);
}
static int SingQuery(const ptrToTreeArr tp,int p)
{
	return tp->RawArr[p];
#if 0
	llong ret = tp->T[p];
	while(--p)ret-=tp->T[p];
	return (int)ret;
#endif
#if 0
	return presum(tp,p)-presum(tp,p-1);
#endif
}