//acwing 796
#include <iostream>
using namespace std;
const int N = 1e5 + 10;
int a[N], b[N]; //b[N]为a[N]的差分数组 --> a[i] = b[1] + b[2] + ... + b[i]
void insert(int l, int r, int c)
{
b[l] += c;
b[r + 1] -= c;
}
int main()
{
int n, m;
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i ++ ) scanf("%d", &a[i]);
//构造a[N]的差分数组b[N]
for (int i = 1; i <= n; i ++ ) insert(i, i, a[i]);
while (m -- )
{
int l, r, c;
scanf("%d%d%d", &l, &r, &c);
insert(l, r, c);
}
//求出b数组的前缀和 --> 得到a数组
for (int i = 1; i <= n; i ++ ) b[i] += b[i - 1];
for (int i = 1; i <= n; i ++ ) printf("%d ", b[i]);
return 0;
}
(C++) 基础算法学习:一维差分
于 2023-02-05 14:43:24 首次发布