HDU 1166

题意：

中文。。略过

思路：

果断的线段树裸题， 这是我线段树的第一道题，分别用了大神的预定义法+数组下标 和 结构体+指针做。

看来还是大神的方法比较强一些，代码量就少，而且速度和内存用量都少。

终于明白大神为什么都愿意用先开一个数组来进行数据结构了，这样快啊。（起码快三分之一）

第一个是开数组的，第二个是动态开内存的。

而且动态开内存的，如果最后不进行delete的话，很容易爆内存的。。。

Code（开数组）：

#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<stack>
#include<bitset>
#include<set>
#include<map>
#include<cctype>
#include<vector>

#define TEST

#define LL long long
#define Mt(f, x) memset(f, x, sizeof(f));
#define xep(i, n) for(int i = 0; i < (n); ++i)
#define rep(i, s, e) for(int i = (s); i <= (e); ++i)
#define dep(i, s, e) for(int i = (s); i >= (e); --i)
#ifdef TEST
    #define See(a) cout << #a << " = " << a << endl;
    #define See2(a, b) cout << #a << " = " << a << ' ' << #b << " = " << b << endl;
    #define debug(a, s, e){ rep(_i, s, e) {cout << a[_i] << ' '; }cout << endl;}
    #define debug2(a, s, e, ss, ee) rep(i_, s, e) {debug(a[i_], ss, ee);}
#else
    #define See(a) {}
    #define See2(a, b) {}
    #define debug(a, s, e) {}
    #define debug2(a, s, e, ss, ee) {}
#endif

const int MAX = 2e9;
const int MIN = -2e9;
const int PI = acos(-1.0);
const double eps = 1e-9;

using namespace std;

#define lson l, m, rt << 1
#define rson m + 1, r, rt << 1 | 1

const int N = 50000 + 5;

int sum[N << 2];
int n;

inline void pushUp(int rt)
{
    sum[rt] = sum[rt << 1] + sum[rt << 1 | 1];
}

void build(int l, int r, int rt)
{
    if(l == r)
    {
        scanf("%d", &sum[rt]);
        return ;
    }
    int m = (l + r) >> 1;
    build(lson);
    build(rson);
    pushUp(rt);
}

void update(int I, int add, int l, int r, int rt)
{
    if(l == r)
    {
        sum[rt] += add;
        return ;
    }
    int m = (l + r) >> 1;
    if(I <= m) update(I, add, lson);
    else update(I, add, rson);
    pushUp(rt);
}

int query(int L, int R, int l, int r, int rt)
{
    if(L <= l && R >= r)
    {
        return sum[rt];
    }
    int m = (l + r) >> 1;
    int ret = 0;
    if(L <= m) ret = query(L, R, lson);
    if(R > m) ret += query(L, R, rson);
    return ret;
}

int main()
{
    int T;
    cin >> T;
    rep(_, 1, T)
    {
        printf("Case %d:\n", _);
        scanf("%d", &n);
        char op[10];
        build(1, n, 1);
        int a, b;
        while(scanf("%s", op))
        {
            if(op[0] == 'E')
            {
                break;
            }
            else
            {
                scanf("%d%d", &a, &b);
                if(op[0] == 'A')update(a, b, 1, n, 1);
                else if(op[0] == 'S') update(a, -b, 1, n, 1);
                else
                {
                    printf("%d\n", query(a, b, 1, n, 1));
                }
            }
        }
    }
    return 0;
}

Code（动态内存）：

#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<stack>
#include<bitset>
#include<set>
#include<map>
#include<cctype>
#include<vector>

#define TEST

#define LL long long
#define Mt(f, x) memset(f, x, sizeof(f));
#define xep(i, n) for(int i = 0; i < (n); ++i)
#define rep(i, s, e) for(int i = (s); i <= (e); ++i)
#define dep(i, s, e) for(int i = (s); i >= (e); --i)
#ifdef TEST
    #define See(a) cout << #a << " = " << a << endl;
    #define See2(a, b) cout << #a << " = " << a << ' ' << #b << " = " << b << endl;
    #define debug(a, s, e){ rep(_i, s, e) {cout << a[_i] << ' '; }cout << endl;}
    #define debug2(a, s, e, ss, ee) rep(i_, s, e) {debug(a[i_], ss, ee);}
#else
    #define See(a) {}
    #define See2(a, b) {}
    #define debug(a, s, e) {}
    #define debug2(a, s, e, ss, ee) {}
#endif

const int MAX = 2e9;
const int MIN = -2e9;
const int PI = acos(-1.0);
const double eps = 1e-9;

using namespace std;

struct Node
{
    int v;
    int left, right;
    Node *l, *r;
    Node(){}
    Node(int l, int r) : left(l), right(r) {}
}*root;

int build(Node* &root, int l, int r)
{
//    printf("left = %d right = %d\n", root -> left, root -> right);
    if(l == r)
    {
        root -> left = root -> right = l;
        scanf("%d", &(root -> v));
//        printf("%d left = %d right = %d\n", root -> v, root -> left, root -> right);
        return root -> v;
    }
    int m = (l + r) >> 1;
    root -> l = new Node(l, m);
    root -> r = new Node(m + 1, r);
    return root -> v = build(root -> l, l, m) + build(root -> r, m + 1, r);
}

void update(Node* &root, int I, int add)
{
    if(root -> left == root -> right)
    {
        root -> v += add;
        return ;
    }
    int m = (root -> left + root -> right) >> 1;
    if(I <= m) update(root -> l, I, add);
    else update(root -> r, I, add);
    root -> v = root -> l -> v + root -> r -> v;
}

int query(Node* &root, int L, int R)
{
    if(root -> left >= L && root -> right <= R)
    {
        return root -> v;
    }
    int m = (root -> left + root -> right) >> 1;
    int ret = 0;
    if(L <= m) ret += query(root -> l, L, R);
    if(R > m) ret += query(root -> r, L, R);
    return ret;
}

void del(Node* &root)
{
    if(root -> left == root -> right)
    {
        return ;
    }
    del(root -> l);
    del(root -> r);
    delete root -> l;
    delete root -> r;
}

int main()
{
    int T;
    cin >> T;
    rep(_, 1, T)
    {
        printf("Case %d:\n", _);
        int n;
        scanf("%d", &n);
        root = new Node(1, n);
        build(root, 1, n);
        char op[10];
        while(scanf("%s", op))
        {
            if(op[0] == 'E')
            {
                del(root);
                break;
            }
            else
            {
                int a, b;
                scanf("%d%d", &a, &b);
                if(op[0] == 'A')
                {
                    update(root, a, b);
                }
                else if(op[0] == 'S')
                {
                    update(root, a, -b);
                }
                else
                {
                    printf("%d\n", query(root, a, b));
                }
            }
        }
    }
    return 0;
}<strong>
</strong>