一维差分应用

输入长度为n的整数序列,操作有m次

每次输入l,r,c,表示在第l到r的元素，每个元素加c

#include <iostream>

using namespace std;

const int N = 100010;

int n, m;
int a[N], b[N];

void insert(int l, int r, int c)
{
    b[l] += c;    //在这里任意一个元素加c 前缀和都会加1个c
    b[r+1] -= c;    //区间结束后再把c减回去
}

int main()
{
    cin >> n >> m ;

    for (int i = 1; i <= n; i++)
            cin >> a[i];

    for (int i = 1; i <= n; i++)
        b[i] = a[i] - a[i - 1];
        //insert(i,i,a[i]);
        
    while (m--)
    {
        int r, l, c;
        cin >> l >> r >> c;
        insert(r, l, c);
    }

    for (int i = 1; i <= n; i++)
    {
        a[i] = a[i - 1] + b[i];
        //b[i] += b[i - 1];   同样可以表示前缀和
        cout << a[i] << " ";
    }
    

    return 0;
}