AcWing 797. 差分
原题链接
简单
作者:
未来可期_8
,
2025-03-26 13:16:08
·北京
,
所有人可见
,
阅读 2
#include<bits/stdc++.h>
using namespace std;
int n, m;
const int N = 100010;
int a[N], b[N];
void insert(int l, int r, int c) {
b[l] += c;
b[r + 1] -= c;
}
int main() {
scanf("%d %d", &n, &m);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
insert(i, i, a[i]);
}
while (m--) {
int l, r, c;
scanf("%d %d %d", &l, &r, &c);
insert(l, r, c);
}
for (int i = 1; i <= n; i++) {
b[i] += b[i - 1];
printf("%d ", b[i]);
}
return 0;
}