树状数组BIT 模板

/*
  * author : qiu
  * coding : utf-8
  * time : 2014-12--
  * //fun: BIT_tree
  *
*/
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#define debug puts("-----")
#define PI (acos(-1.0))
#define EPS (1e-8)
#define INF (1<<28)
const int N=100000;
using namespace std;
int c[N];
int n;
//  lowbit
int lowbit(int x)
{
    return x&(-x);
}
// add
void add(int k, int data)
{
      while(k <= n){
              c[k] += data;
              k += lowbit(k);
           
      }
}
// sum
int sum(int k)
{
          int ans = 0;
             while(k > 0){

               ans +=c[k];
               k -= lowbit(k);
             }
     return ans;
}
int main(){
                           
             memset(c, 0, sizeof(c));
                    for(int i=1; i<=10; i++)
                           add(i, i);
                    for(int i=1; i<=10; i++)
                      cout <<  c[i] << endl;
                      add(5, 10);
                       for(int i=1; i<=10; i++)
                      cout <<  c[i] << endl;
                    
	return 0;
}