HDU 1166 线段树基础题目单点更新

P话不多说了直接代码

#include <map>
#include <set>
#include <list>
#include <cmath>
#include<cctype>
#include <ctime>
#include <deque>
#include <stack>
#include <queue>
#include <cstdio>
#include <string>
#include <vector>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
#define LL long long
#define PI 3.1415926535897932626
using namespace std;
int gcd(int a, int b)
{
	return a % b == 0 ? b : gcd(b, a % b);
}
char input[4][10]={{"Add"},{"Sub"},{"Query"},{"End"}};
struct node
{
    int l,r;
    int sum;
}tree[200010];
int src[50010];
void buildtree(int id ,int L, int R)
{
    tree[id].l=L;tree[id].r=R;
    if (L==R)
    {
        tree[id].sum=src[L];
    }
    else
    {
        int mid=(L+R)/2;
        buildtree(id*2,L,mid);
        buildtree(id*2+1,mid+1,R);
        tree[id].sum=tree[id*2].sum+tree[id*2+1].sum;
    }
}
void update (int id ,int pos ,int val)
{
    tree[id].sum+=val;
    if (tree[id].l==tree[id].r) return ;
    int mid=(tree[id].l+tree[id].r)/2;
    if (mid<pos) update(id*2+1,pos,val);
    else update(id*2,pos,val);
}
int query(int id,int l ,int r)
{
    if (tree[id].l==l && tree[id].r==r)
        return tree[id].sum;
    int mid=(tree[id].l+tree[id].r)/2;
    if (l>mid) return query(id*2+1,l,r);
    else if (r<=mid) return query(id*2,l,r);
    else return query(id*2,l,mid)+query(id*2+1,mid+1,r);
}
int main()
{
    int T;
    scanf("%d",&T);
    int kase=1;
    while (T--)
    {
        printf("Case %d:\n",kase++);
        int N;
        scanf("%d",&N);
        for (int i=1;i<=N;i++)
            scanf("%d",&src[i]);
            buildtree(1,1,N);
        char res[10];
        while (scanf("%s",res)==1)
        {
            int i;
            for ( i=0;i<4;i++)
              if (strcmp(res,input[i])==0)
              break;
            if (i==3) break;
            int a,b;
            scanf("%d%d",&a,&b);
            if (i==2)
            {
                printf("%d\n",query(1,a,b));
            }
            if (i==1)
            {
                b*=-1;
                update(1,a,b);
            }
            if (i==0)
            {
                update(1,a,b);
            }
            getchar();
        }
    }
    return 0;
}