#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
#include <queue>
using namespace std;
#define lc o*2
#define rc o*2+1
typedef long long LL;
const int maxn = 100010;
LL sumv[maxn<<2];
LL addv[maxn<<2];
int n, m;
void pushup(int o)
{
sumv[o] = sumv[lc] + sumv[rc];
}
void pushdown(int o, int m)
{
if(addv[o])
{
addv[lc] += addv[o];
addv[rc] += addv[o];
sumv[lc] += addv[o] * (m-(m>>1));
sumv[rc] += addv[o] * (m>>1);
addv[o] = 0;
}
}
void build(int o, int L, int R)
{
int M = L + (R-L)/2;
if(L == R) { scanf("%lld", &sumv[o]); return; }
build(lc, L, M);
build(rc, M+1, R);
pushup(o);
}
void update(int o, int y1, int y2, int L, int R, LL v)
{
if(y1 <= L && y2 >= R)
{
addv[o] += v;
sumv[o] += LL(v) * (R-L+1);
return ;
}
pushdown(o, R-L+1);
int M = L + (R-L)/2;
if(y1 <= M) update(lc, y1, y2, L, M, v);
if(y2 > M) update(rc, y1, y2, M+1, R, v);
pushup(o);
}
LL query(int o, int y1, int y2, int L, int R)
{
if(y1 <= L && y2 >= R) return sumv[o];
LL ans = 0;
int M = L + (R-L)/2;
pushdown(o, R-L+1);
if(y1 <= M) ans += query(lc, y1, y2, L, M);
if(y2 > M) ans += query(rc, y1, y2, M+1, R);
return ans;
}
void solve()
{
build(1, 1, n);
char op[3];
int y1, y2;
LL v;
while(m--)
{
scanf("%s %d %d", op, &y1, &y2);
if(op[0] == 'Q') { printf("%lld\n", query(1, y1, y2, 1, n)); }
else { scanf("%lld", &v); update(1, y1, y2, 1, n, v); }
}
}
int main()
{
while(~scanf("%d%d", &n, &m))
{
solve();
}
return 0;
}
POJ 3468 A Simple Problem with Integers
最新推荐文章于 2023-10-02 10:26:46 发布