【線段樹 && 區間增減】POJ 3468 A Simple Problem with Integers

Problem Description

裸的區間增減的題目，由于資料有點大，得用long long。輸入n,m 有n個元素，m次詢問。C a b c 将區間a-b的數全部加c，Q a b，求區間a-b的和

代碼：

#include<cstdio>
using namespace std;
struct node
{
    long long num, lazy;
};
node tree[];
#define MID int mid = (l + r) / 2
//預處理
#define lson root<<1
#define rson root<<1|1
node merge_(node x, node y)
//回潮求和
{
    node t;
    t.lazy = ;
//因為這裡沒有初始化，wrong了 好多遍
    t.num = x.num + y.num;
    return t;
}
void build(int root, int l, int r)
//初始化線段樹
{
    tree[root].lazy = ;
//初始化0
    if(l == r)
    {
        scanf("%lld", &tree[root].num);
//輸入
        return ;
    }
    MID;
    build(lson, l, mid);
//左子樹遞歸
    build(rson, mid + , r);
//右子樹遞歸
    tree[root] = merge_(tree[lson], tree[rson]);
}
void pushdown(int root, int l, int r)
//向下更新
{
    if(tree[root].lazy) {//如果lazy有值的話
    tree[lson].lazy += tree[root].lazy;
//左孩子lazy 值更新
    tree[rson].lazy += tree[root].lazy;
//右孩子lazy 值更新
    MID;
    tree[lson].num += (mid - l + ) * tree[root].lazy;//更新和
    tree[rson].num += (r - (mid + ) + ) * tree[root].lazy;
//更新和
    tree[root].lazy = ;
//變為0
    }
}
void updata(int root, int l, int r, int ul, int ur, long long v)
//區間ul-ur增加v
{
    if(ul <= l && r <= ur)
//在區間内
    {
        tree[root].lazy += v;
        tree[root].num += (r - l + ) * v;
        return ;
    }
    pushdown(root, l, r);
//向下更新lazy
    MID;
    if(mid >= ul) updata(lson, l, mid, ul, ur, v);
//遞歸
    if(mid < ur) updata(rson, mid + , r, ul, ur, v);
//遞歸
    tree[root] = merge_(tree[lson], tree[rson]);
//歸并
}
long long query(int root, int l, int r, int ul, int ur)
//求ul-ur的和
{
    if(ul <= l && r <= ur)
//在區間内傳回值
    {
        return tree[root].num;
    }
    pushdown(root, l, r);
    MID;
    long long red = ;
    if(mid >= ul) red = query(lson, l, mid, ul, ur);
//mid 在 左孩子區間
    if(mid < ur) ryou query(rson, mid + , r, ul, ur);
//mid 在 右孩子區間
    return red;
}
int main()
{
    int n, m, L, R;
    long long v;
    char c;
    while(~scanf("%d %d", &n, &m))
    {
        build(, , n);
        while(m--)
        {
            scanf("%*c%c", &c);
            if(c == 'Q')
            {
                scanf("%d %d", &L, &R);
                printf("%lld\n", query(, , n, L, R));
            }
            else
            {
                scanf("%d %d %lld", &L, &R, &v);
                updata(, , n, L, R, v);
            }
        }
    }
    return ;
}