给定一个n个元素的数组A1,A2,A3,... ,An, 你的任务是设计一种数据结构,一共m次操作,支持一下两种操作:
1. Add(x,d)操作:让Ax增加d。
2. Query(L,R): 计算A(L)+A(L+1)+...+A(R).
树状数组:
//
// main.cpp
// Calmeii
//
// Created by Calmeii on 14-5-7.
// Copyright (c) 2014年 apple. All rights reserved.
//
#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
using namespace std;
#define MAXN 100
#define lowbit(x) ((x)&(-x))
int n, C[MAXN], a[MAXN]; //C存放当前位的长条和
void add(int id, int v)
{
while (id <= n) //往右上加
{
C[id] += v;
id += lowbit(id);
}
}
int sum(int id)
{
int val = 0;
while (id > 0) //往左下减
{
val += C[id];
id -= lowbit(id);
}
return val;
}
int main()
{
int m;
while (scanf("%d%d", &n, &m) != EOF)
{
for (int i = 1; i <= n; i++){
scanf("%d", &a[i]);
for (int j = i-lowbit(i)+1; j <= i; j++){ //求C数组
C[i] += a[j];
}
}
for (int i = 0; i < m; i++){
int s, e;
char str[5];
scanf("%s%d%d", str, &s, &e);
if (!strcmp(str, "add")){
add(s, e);
}
else if (!strcmp(str, "sum")){
printf("%d\n", sum(e)-sum(s-1));
}
}
}
return 0;
}
/*
10 30
1 2 3 4 5 6 7 8 9 10
*/
code: