【线段树】HDU 1166 敌兵布阵

HDU 1166 敌兵布阵

• 题意：单点修改，区间查询。
• My_Feeling：字符串处理比较烦，每次都是这里错，而且还不知道为什么，反正改了一种方式之后就A了。

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <queue>
#include <cmath>
#include <cstring>
#include <string>
#include <vector>
#include <set>
#include <stack>
#include <list>
#include <map>
#define INF 0x3f3f3f3f
#define P(x) x>0 ? x : 0
#define MID l + r >> 1
#define lsn rt << 1
#define rsn rt << 1 | 1
#define Lson lsn, l, mid
#define Rson rsn, mid+1, r
#define QL Lson, ql, qr
#define QR Rson, ql, qr

using namespace std;
typedef long long ll;
typedef vector<int>:: iterator VITer;
const int maxN=5e4+5;
int tree[maxN<<2],lazy[maxN<<2];
int N,a[maxN];

void pushup(int rt) { tree[rt] = tree[lsn] + tree[rsn]; }

void build_tree(int rt,int l,int r)
{
    if(l == r) { tree[rt] = a[l]; return; }
    int mid = MID;
    build_tree(Lson);
    build_tree(Rson);
    pushup(rt);
}

void update_point(int rt,int l,int r,int pos,int val)
{
    if(l == r) { tree[rt] += val; tree[rt] = P(tree[rt]); return; }
    int mid=MID;
    if(pos <= mid) update_point(Lson, pos, val);
    else if(pos > mid) update_point(Rson, pos, val);
    pushup(rt);
}

int query(int rt,int l,int r,int ql,int qr)
{
    if(ql <= l && qr >= r) return tree[rt];
    int mid=MID;
    if(qr <= mid) return query(QL);
    else if(ql > mid) return query(QR);
    else return query(QL)+query(QR);
}

void init()
{
    memset(lazy, 0, sizeof(lazy));
}

int main()
{
    int T; scanf("%d", &T);
    for(int Case = 1; Case <= T ; Case++)
    {
        //printf("Case %d:\n",Case);
        init();
        scanf("%d", &N);
        for(int i = 1 ; i <= N ; i++)
        {
            scanf("%d", &a[i]);
        }
        printf("Case %d:\n",Case);
        build_tree(1,1,N);
        char s[10];
        while(scanf("%s",s))
        {
            if(strcmp(s, "End") == 0) break;
            int aa,bb; scanf("%d%d", &aa, &bb);
            if(strcmp(s, "Add") == 0) update_point(1, 1, N, aa, bb);
            else if(strcmp(s, "Sub") == 0) update_point(1, 1, N, aa, -bb);
            else if(strcmp(s, "Query")==0)  printf("%d\n", query(1, 1, N, aa, bb));
        }
    }
    return 0;
}