#include<iostream>
#include<map>
#include<algorithm>
#include<math.h>
using namespace std;
typedef long long ll;
const int N = 1e5 + 10;
ll a[N] = { 0 };
ll tree[N << 2] = { 0 };
ll tag[N << 2] = { 0 };
ll ls(ll p) { return p << 1; }
ll rs(ll p) { return p << 1 | 1; }
void push_up(ll p)
{
tree[p] = tree[ls(p)] + tree[rs(p)];
}
void build(ll p, ll pl, ll pr)
{
tag[p] = 0;
if (pl == pr) { tree[p] = a[pl]; return; }
ll mid = (pl + pr) >> 1;
build(ls(p), pl, mid);
build(rs(p), mid + 1, pr);
push_up(p);
}
void addtag(ll p, ll pl, ll pr, ll d)
{
tag[p] += d;
tree[p] += d * (pr - pl + 1);
}
void push_down(ll p, ll pl, ll pr)
{
if (tag[p])
{
ll mid = (pl + pr) >> 1;
addtag(ls(p), pl, mid, tag[p]);
addtag(rs(p), mid + 1, pr, tag[p]);
tag[p] = 0;
}
}
void update(ll L, ll R, ll p, ll pl, ll pr, ll d)
{
if (L <= pl and pr <= R) { addtag(p, pl, pr, d); return; }
push_down(p, pl, pr);
ll mid = (pl + pr) >> 1;
if (L <= mid)update(L, R, ls(p), pl, mid, d);
if (R > mid)update(L, R, rs(p), mid + 1, pr, d);
push_up(p);
}
ll query(ll L, ll R, ll p, ll pl, ll pr)
{
if (pl >= L and pr <= R)return tree[p];
push_down(p, pl, pr);
ll res = 0;
ll mid = (pl + pr) >> 1;
if (L <=mid)res += query(L, R, ls(p), pl, mid);
if (R > mid)res += query(L, R, rs(p), mid + 1, pr);
return res;
}
int main()
{
ll n, m; cin >> n >> m;
for (ll i = 1; i <= n; i++)cin >> a[i];
build(1, 1, n);
while (m--)
{
ll q, L, R, d;
cin >> q;
if (q == 1)
{
cin >> L >> R >> d;
update(L, R, 1, 1, n, d);
}
else
{
cin >> L >> R;
cout << query(L, R, 1, 1, n)<<endl;
}
}
}
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】凌霞软件回馈社区,博客园 & 1Panel & Halo 联合会员上线
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】博客园社区专享云产品让利特惠,阿里云新客6.5折上折
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步
· 在鹅厂做java开发是什么体验
· 百万级群聊的设计实践
· WPF到Web的无缝过渡:英雄联盟客户端的OpenSilver迁移实战
· 永远不要相信用户的输入:从 SQL 注入攻防看输入验证的重要性
· 浏览器原生「磁吸」效果!Anchor Positioning 锚点定位神器解析