//#pragma GCC optimize(2)
#include <bits/stdc++.h>
#define endl '\n'
#define int long long
#define INF 0x3f3f3f3f
#define ull unsigned long long
#define mem(a, b) memset(a, b, sizeof(a))
#define ck(x) cerr << #x << "=" << x << '\n';
using namespace std;
typedef pair<int, int> PII;
const int N = 1e5 + 7, mod = 1e9 + 7;
int a[N];
struct Node
{
int l, r; //树的点代表的边界
int sum, lazy; //总和,懒标记
} tr[N << 2];
inline void pushup(int u) //向上更新父节点
{
tr[u].sum = tr[u * 2].sum + tr[u * 2 + 1].sum;
}
inline void pushdown(int u) //懒标记下推
{
if (tr[u].lazy)
{
//修改左右儿子的和值
tr[u * 2].sum += tr[u].lazy * (tr[u * 2].r - tr[u * 2].l + 1);
tr[u * 2 + 1].sum += tr[u].lazy * (tr[u * 2 + 1].r - tr[u * 2 + 1].l + 1);
//修改左右儿子懒标记值
tr[u * 2].lazy += tr[u].lazy;
tr[u * 2 + 1].lazy += tr[u].lazy;
tr[u].lazy = 0;
}
}
void build(int u, int l, int r) //建树
{
tr[u].l = l, tr[u].r = r;
if (l == r)
{
tr[u].sum = a[l];
return;
}
int mid = (l + r) >> 1;
build(u * 2, l, mid), build(u * 2 + 1, mid + 1, r);
pushup(u);
}
void modify(int u, int l, int r, int d) //区间修改
{
if (l <= tr[u].l && r >= tr[u].r) //结点区域为修改区域子集
{
tr[u].sum += d * (tr[u].r - tr[u].l + 1); //打上懒标记返回
tr[u].lazy += d;
return;
}
pushdown(u); //懒标记下推
int mid = (tr[u].l + tr[u].r) >> 1;
if (l <= mid) modify(u * 2, l, r, d);
if (r > mid) modify(u * 2 + 1, l, r, d);
pushup(u);
}
int query(int u, int l, int r) //区间查询
{
if (l <= tr[u].l && r >= tr[u].r) return tr[u].sum;
pushdown(u); //懒标记下推
int mid = (tr[u].l + tr[u].r) >> 1;
int sum = 0;
if (l <= mid) sum += query(u * 2, l, r);
if (r > mid) sum += query(u * 2 + 1, l, r);
return sum;
}
signed main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n;
for (int i = 1; i <= n; i++) cin >> a[i];
build(1, 1, n);
cin >> m;
for (int i = 1; i <= m; i++)
{
int flag;
cin >> flag;
if (flag == 2)
{
int x, y;
for (int i = 1; i <= n; i++) cout << query(1, i, i) << ' ';
cout << endl;
}
if (flag == 1)
{
int x, y, z;
cin >> x >> y >> z;
modify(1, x, y, z);
}
}
}
09-18
239
05-24
238
07-18
3万+
07-24
1万+
03-20
5152
07-26
4246