HDU -1166 线段树

#include <algorithm>
#include <iostream>
#include<sstream>
#include<cstring>
#include<string>
#include<cstdio>
#include<cctype>
#include<vector>
#include<deque>
#include<map>
#include<set>

#define M 50000
#define inf 0x3f3f3f3f
typedef long long ll;

using namespace std;

struct Data
{
    int left, right, sum, lazy;
}tree[M*];
int n;
int sum, lazy;
int x, y;
string str;

void built(int l,int r,int k) {
    tree[k].left = l, tree[k].right = r;
    if (l == r) {
        scanf("%d", &tree[k].sum);
        return;
    }
    int mid = (l + r) / ;
    built(l, mid,k*);
    built(mid + , r, k *  + );
    tree[k].sum = tree[k * ].sum + tree[k *  + ].sum;
}

void down(int k) {
    lazy = tree[k].lazy;
    tree[k].lazy = ;
    tree[k * ].lazy += lazy;
    tree[k *  + ].lazy += lazy;
    tree[k * ].sum += (tree[k * ].right - tree[k * ].left + ) * lazy;
    tree[k *  + ].sum += (tree[k *  + ].right - tree[k *  + ].left + ) * lazy;
}

void search(int k) {
    if (tree[k].left >=x && tree[k].right <=y) {
        sum += tree[k].sum;
        return;
    }
    if (tree[k].lazy)down(k);
    int mid = (tree[k].left + tree[k].right) / ;
    if (x <= mid)search(k * );
    if (y > mid)search(k *  + );
}

void change_inv(int k) {
    if (tree[k].left == tree[k].right) {
        //tree[k].lazy += add;
        tree[k].sum += y;
        return;
    }
    if (tree[k].lazy)down(k);
    int mid = (tree[k].left + tree[k].right) / ;
    if (x <= mid)change_inv(k * );
    else change_inv(k *  + );
    tree[k].sum = tree[k * ].sum + tree[k *  + ].sum;
}

int main() {
    int T;
    cin >> T;
    for (int Case = ; Case <= T; Case++) {
        scanf("%d", &n);
        built(, n, );
        printf("Case %d:\n", Case);
        while (true){
            cin >> str;
            if (str == "End")break;
            scanf("%d%d", &x, &y);
            if (str == "Add") {
                change_inv();
            }
            else if (str == "Sub") {
                y *= -;
                change_inv();
            }
            else if (str == "Query") {
                sum = ;
                search();
                printf("%d\n", sum);
            }
        }
    }
    return ;
}