算法板子：差分——一段区间内的数都加c

b数组是a数组的差分数组，a数组是b数组的前缀和数组：
a[i] = b[1] + … + b[i]
b[i] = a[i] - a[i- 1]

#include <iostream>
using namespace std;

const int N = 1e5 + 10;
int a[N], b[N];

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的差分数组b; b[i]=a[i]-a[i-1]; 前缀和数组和差分数组是一种逆运算
    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);
    }
    
    // 得到[l,r]加上c的a; 此时的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;
}