线段树-HDU-敌兵布阵

HDU-1166 敌兵布阵

#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<cstring>
#include<iostream>
using namespace std;
int num[50005];
struct Node
{
    int l,r;
    int Sum;
} Tree[5000005];

void Build(int i,int l,int r)//建树
{
    Tree[i].l=l;
    Tree[i].r=r;
    if(l == r)
    {
        Tree[i].Sum = num[l];
        return;
    }
    int mid = (l + r) / 2;
    Build(i *2, l, mid);
    Build(i *2 + 1, mid+1, r);
    Tree[i].Sum = Tree[i * 2].Sum + Tree[i *2 + 1].Sum;
}
void Add(int i, int t, int b)//单点修改
{
    Tree[i].Sum += b;
    if(Tree[i].l == t && Tree[i].r == t)
    {
        return;
    }
    int mid=(Tree[i].l+Tree[i].r)/2;
    if(t <= mid)
        Add(i * 2, t, b);
    else
        Add(i * 2 + 1, t, b);
}
int Query(int i,int l,int r)//区间求和
{
    if(l == Tree[i].l && r == Tree[i].r)
        return Tree[i].Sum;
    int mid=(Tree[i].l + Tree[i].r) / 2;
    if(r <= mid)
        return Query(i * 2, l, r);
    else if(l > mid)
        return Query( i * 2 + 1, l, r);
    else
        return Query(i * 2, l, mid) + Query(i * 2 + 1, mid+1, r);
}
int main()
{
    int n, i;
    char b[20];
    int p  = 1;
    while(~scanf("%d",&n))
    {

        while(n--)
        { cout<<"Case "<<p<<":"<<endl;
        p++;
            int m;
            scanf("%d", &m);
            for(i = 1; i <= m; i++)
                scanf("%d",&num[i]);
            Build(1, 1, m);
            while(~scanf("%s",b))
            {
                int x,y;
                if(b[0] == 'E')
                    break;
                if(b[0] == 'Q')
                {
                    scanf("%d%d",&x, &y);
                    cout << Query(1, x, y) << endl;;
                }
                if(b[0] == 'A')
                {
                    scanf("%d%d",&x, &y);
                    Add(1, x,y);
                }
                if(b[0] == 'S')
                {
                    scanf("%d%d",&x,&y);
                    Add(1, x, -y);
                }
            }
        }
    }
    return 0;
}