A Simple Problem with Integers 树状数组 区间更新 区间查询

树状数组模板
https://www.cnblogs.com/xenny/p/9739600.html

#include<cstdio>
#include<iostream>
#include<cstring>
using namespace std;
int n,m;
long long a[500005] = {0};
long long sum1[500005];    //(D[1] + D[2] + ... + D[n])
long long sum2[500005];    //(1*D[1] + 2*D[2] + ... + n*D[n])

int lowbit(int x){
    return x&(-x);
}

void updata(int i,int k){
    int x = i;    //因为x不变，所以得先保存i值
    while(i <= n){
        sum1[i] += k;
        sum2[i] += k * (x-1);
        i += lowbit(i);
    }
}

long long getsum(int i){        //求前缀和
    long long res = 0, x = i;
    while(i > 0){
        res +=(long long)( x * sum1[i] - sum2[i]);
        i -= lowbit(i);
    }
    return res;
}

int main(){
    cin>>n;
    cin>>m;
    for(int i = 1; i <= n; i++){
        cin>>a[i];
        updata(i,a[i] - a[i-1]);   //输入初值的时候，也相当于更新了值
    }

    char s[5];
    int x,y,k;
    for(int i=1;i<=m;i++)
    {
        cin>>s;
        if(s[0]=='C')
        {
            cin>>x>>y>>k;
            updata(x,k);    //A[x] - A[x-1]增加k
            updata(y+1,-k);        //A[y+1] - A[y]减少k
        }
        else
        {
            cin>>x>>y;
            cout<<getsum(y) - getsum(x-1)<<endl;;
        }
    }
    return 0;
}