HDU 1166 敌兵布阵(线段树or树状数组)

线段树方法

#include <iostream> 
#include <cstdio> 
#include <fstream> 
#include <algorithm> 
#include <cmath> 
#include <deque> 
#include <vector> 
#include <queue> 
#include <string> 
#include <cstring> 
#include <map> 
#include <stack> 
#include <set> 
#include <list>
#define INF 0x3f3f3f
#define maxn 50000 + 50 
#define juzheng 300

#define ll long long

using namespace std;

//Date:2017-9-4
//Author：HarryBlackCat 

struct xx{
    int left;
    int right;
    int val;
}tree[140000];

int arr[maxn],n,sum;

void bulid_tree(int node,int left,int right){
    tree[node].left = left;
    tree[node].right = right;

    if(left == right)
        tree[node].val = arr[left];//左右区间相等 赋值 
    else{
        int mid = (left + right) / 2;
        bulid_tree(node * 2,left,mid);
        bulid_tree(node * 2 + 1,mid + 1,right);

        tree[node].val = tree[node * 2].val + tree[node * 2 + 1].val;//父亲节点的val为左右孩子的val和 
    }
}

void add(int node,int index,int val){
    tree[node].val += val;//从根节点开始修改值 

    if(tree[node].right == tree[node].left)//找到值停止更新 
        return;

    int mid = (tree[node].left + tree[node].right) / 2;
    if(index > mid)//判断值所在区间 
        add(node * 2 + 1,index,val);
    else
        add(node * 2,index,val);
}

void get_sum(int node,int left,int right){
    if(tree[node].left >= left && tree[node].right <= right)//将该区间所有子区间的值全部加起来 
        sum += tree[node].val;
    else{
        int mid = (tree[node].left + tree[node].right) / 2;
        if(left > mid)//左区间比当前区间mid大查找右节点 
            get_sum(node * 2 + 1,left,right);
        else if(right <= mid)//右区间比当前区间mid小查找左节点 
            get_sum(node * 2,left,right);
        else{//当区间在夹在当前区间是左右节点都要查找 
            get_sum(node * 2,left,right);
            get_sum(node * 2 + 1,left,right);
        } 
    }
}

int main(){
    int t,s,e,index,val;
    string str;
    while(~scanf("%d",&t)){
        for(int p = 1;p <= t;p++){
            scanf("%d",&n);

            for(int i = 1;i <= n;i++)
                scanf("%d",&arr[i]);

            bulid_tree(1,1,n);

            printf("Case %d:\n",p);
            while(cin >> str){
                if(str[0] == 'Q'){
                    scanf("%d %d",&s,&e);
                    sum = 0;
                    get_sum(1,s,e);
                    printf("%d\n",sum);
                }
                else if(str[0] == 'A'){
                    scanf("%d %d",&index,&val);
                    add(1,index,val);
                }
                else if(str[0] == 'S'){
                    scanf("%d %d",&index,&val);
                    add(1,index,-val);
                }
                else
                    break;
            }
        }
    }   
    return 0;
}

树状数组方法

#include <iostream>
#include <cstdio>
#include <fstream>
#include <algorithm>
#include <cmath>
#include <deque>
#include <vector>
#include <queue>
#include <string>
#include <cstring>
#include <map>
#include <stack>
#include <set>
#include <list>
#define INF 0x3f3f3f
#define maxn 50000 + 50
#define juzheng 300

#define ll long long

using namespace std;

//Date:2017-9-3
//Author：HarryBlackCat

int n,tree[maxn];

int lowbit(int x) {
    return x & (-x);
}

void add(int index,int val) {
    for(int i = index; i <= n; i += lowbit(i))
        tree[i] += val;
}

int get_sum(int index) {
    if(index == 0)//特判一下0的情况 
        return 0;

    int ans = 0;
    for(int i = index; i > 0; i -= lowbit(i))
        ans += tree[i];

    return ans;
}

void init() {
    memset(tree,0,sizeof(tree));
}

int main() {
    int t,index,val,s,e;
    string str;
    while(~scanf("%d",&t)) {
        for(int p = 1; p <= t; p++) {
            scanf("%d",&n);

            init();

            for(int i = 1; i <= n; i++) {
                scanf("%d",&val);
                add(i,val);
            }

            printf("Case %d:\n",p);
            while(cin >> str) {
                if(str[0] == 'A') {
                    scanf("%d %d",&index,&val);
                    add(index,val);
                } 
                else if(str[0] == 'S') {
                    scanf("%d %d",&index,&val);
                    add(index,-val);
                } 
                else if(str[0] == 'Q') {
                    scanf("%d %d",&s,&e);
                    cout << get_sum(e) - get_sum(s - 1) << endl;
                } 
                else
                    break;
            }
        }
    }
    return 0;
}