敌兵布阵（HDU1166）（区间求和+单点修改）

题目地址
配套地址

看错题，写了一个区间修改的。[pos,pos]修改的。可以去掉add

#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#include<bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
const int mod = 998244353;
//#define int long long
typedef long long ll;
#define endl '\n'

#define sum(x) t[x].sum
#define add(x) t[x].add
#define ls(x) (x<<1)
#define rs(x) (x<<1|1)

struct SegmentTree {
    int sum,add;
}t[N<<2];

int a[N];

void push_up(int p) {
    sum(p) = sum(ls(p)) + sum(rs(p));
}

void push_down(int p,int l,int r) {
    int mid = (l + r) >> 1;
    if(add(p) != 0) {
        sum(ls(p)) += (mid - l + 1) * add(p);
        sum(rs(p)) += (r - (mid + 1) + 1) * add(p);
        add(ls(p)) += add(p);
        add(rs(p)) += add(p);
    }
    add(p) = 0;
}

void build(int p,int l,int r) {
    add(p) = 0;
    if(l == r) {
        sum(p) = a[l];
        return ;
    }
    int mid = (l + r) >> 1;
    build(ls(p),l,mid); build(rs(p),mid+1,r);
    push_up(p);
}

void update(int p,int l,int r,int pos,int v) {
    if(l == r) {
        sum(p) += v;
        add(p) += v;
        return ;
    }
    push_down(p,l,r);
    int mid = (l + r) >> 1;
    if(pos <= mid) update(ls(p),l,mid,pos,v);
    else update(rs(p),mid+1,r,pos,v);
    push_up(p);
}

int query(int p,int l,int r,int ql,int qr) {
    if(ql <= l && qr >= r) return sum(p);
    push_down(p,l,r);
    int mid = (l + r) >> 1;
    int res = 0;
    if(ql <= mid) res += query(ls(p),l,mid,ql,qr);
    if(qr > mid) res += query(rs(p),mid+1,r,ql,qr);
    return res;
}

signed main(){
	IOS
	#ifdef ddgo
		freopen("C:\\Users\\asus\\Desktop\\ddgoin.txt","r",stdin);
    #endif
    int tt; cin>>tt;
    for(int kase=1;kase<=tt;kase++) {
        cout<<"Case "<<kase<<":"<<endl;
        int n; cin>>n;
        for(int i=1;i<=n;i++) cin>>a[i];
        build(1,1,n);
        string op;
        while(cin>>op && op != "End") {
            int l,r; cin>>l>>r;
            if(op == "Query") cout<<query(1,1,n,l,r)<<endl;
            else if(op == "Add") update(1,1,n,l,r);
            else if(op == "Sub") update(1,1,n,l,-r);
        }
    }
	return 0;
}