HDU1166-敌兵布阵（线段树）

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1166

 #include<bits/stdc++.h>
 using namespace std;
 class Node
 {
 private:
     int val;
     Node *left, *right;

 public:
     Node();
     void set_val(int v);
     void set_left(Node* t);
     void set_right(Node* t);
     int get_val();
     Node* get_left();
     Node* get_right();
 };

 Node::Node()
 {
     left = NULL;
     right = NULL;
     val = ;
 }

 void Node::set_val(int v)
 {
     val = v;
 }

 void Node::set_left(Node *t)
 {
     left = t;
 }

 void Node::set_right(Node *t)
 {
     right = t;
 }

 int Node::get_val()
 {
     return val;
 }

 Node* Node::get_left()
 {
     return left;
 }

 Node* Node::get_right()
 {
     return right;
 }

 void build(int l, int r, Node* cur, int *a)
 {
     if(l == r)
     {
         cur->set_val(a[l]);
         return;
     }
     int mid = (l + r) >> ;

     cur->set_left(new Node);
     build(l, mid, cur->get_left(), a);

     cur->set_right(new Node);
     build(mid+, r, cur->get_right(), a);

     cur->set_val(cur->get_left()->get_val() + cur->get_right()->get_val());
 }

 void change(int i, int j, int curl, int curr, Node* cur)
 {
     if(curl == curr)
     {
         cur->set_val(cur->get_val() + j);
         return;
     }

     int mid = (curl + curr)>>;
     if(i <= mid)
         change(i, j, curl, mid, cur->get_left());
     else
         change(i, j, mid+, curr, cur->get_right());

     cur->set_val(cur->get_left()->get_val() + cur->get_right()->get_val());
 }

 int Search(int l, int r, int curl, int curr, Node* cur)
 {
     if(l <= curl && r >= curr)
         return cur->get_val();

     int mid = (curl + curr)>>;
     if(l > mid)
         return Search(l, r, mid+, curr, cur->get_right());

     if(r <= mid)
         return Search(l, r, curl, mid, cur->get_left());

     return Search(l, r, curl, mid, cur->get_left()) + Search(l, r, mid+, curr, cur->get_right());
 }
 int main()
 {
     int T;
     scanf("%d", &T);
     char command[],c[][]={"End","Query","Add","Sub"};
     for(int cas = ; cas <= T; cas++)
     {
         int n;
         scanf("%d", &n);
         int *a = new int[n+];
         for(int i = ; i <= n; i++)
             scanf("%d", &a[i]);
         Node *root = new Node;
         build(, n, root, a);
         printf("Case %d:\n", cas);
         int i, j;
         for(;;)
         {
             scanf("%s", command);
             if(!strcmp(command,c[]))
                 break;

             else
             {
                 scanf("%d %d",&i, &j);
                 if(!strcmp(command,c[]))
                     printf("%d\n",Search(i, j ,, n, root));
                 else if(!strcmp(command,c[]))
                     change(i, j, , n, root);
                 else if(!strcmp(command,c[]))
                     change(i, -j, , n, root);
             }
         }
         delete root;
         delete a;
     }
     return ;
 }