模板总结归纳:
实战模板题 :HDU 1166 敌兵布阵
//树状数组
// O(logn)
// HDU 1166 敌兵布阵
const int maxn = 100000;
int Tree[maxn+10];
int lowbit(int x) { return (x&-x); }
void add(int x, int value) //给A[i]加上一个数
{
for(int i = x; i <= maxn; i += lowbit(i))
Tree[i] += value;
}
int get(int x) // 查询 A[1] ~ A[x] 的和
{
int sum = 0;
for(int i = x; i ; i -= lowbit(i))
sum += Tree[i];
return (sum);
}
实战模板题 :HDU 1166 敌兵布阵
#include<cstdio>
#include<iostream>
#include<cstring>
using namespace std;
const int maxn = 100000;
int Tree[maxn+10];
int lowbit(int x) { return (x&-x); }
void add(int x, int value)
{
for(int i = x; i <= maxn; i += lowbit(i))
Tree[i] += value;
}
int get(int x)
{
int sum = 0;
for(int i = x; i ; i -= lowbit(i))
sum += Tree[i];
return (sum);
}
int main()
{
int t;
cin >> t;
for(int j = 1; j <= t; j++){
printf("Case %d:\n", j);
memset(Tree, 0, sizeof(Tree));
int n, temp;
cin >> n;
for(int i = 1; i <= n; i++)
{
scanf("%d", &temp);
add(i, temp);
}
char op[6];
int a, b;
while(~scanf("%s", op)){
if(op[0] == 'E') break;
if(op[0] == 'A'){
scanf("%d%d", &a, &b);
add(a, b);
}
else if(op[0] == 'S'){
scanf("%d%d", &a, &b);
add(a, -b);
}
else if(op[0] == 'Q'){
scanf("%d%d", &a, &b);
printf("%d\n", get(b) - get(a - 1));
}
else
break;
}
}
return 0;
}