题解 | #【模板】差分#

#include <iostream>
#include <queue>
#include <map>
#include <set>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <iomanip>
#include <stack>
#include <numeric>
#include <ctime>
#include <string>
#include <bitset>
#include <unordered_map>
#include <unordered_set>

using namespace std;
using ll = long long;
const ll N = 1e5 + 5, mod = 1e9 + 7, inf = 0x3f3f3f3f;

int n, m;
ll a[N], dp[N];

void solve() {
    cin >> n >> m;

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

    while (m--) {
        ll l, r, k;
        cin >> l >> r >> k;

        dp[l] += k;
        dp[r + 1] -= k;
    }

    for (int i = 1; i <= n; i++) {
        dp[i] += dp[i - 1];
        a[i] += dp[i];
        cout << a[i] << " ";
    }
}

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    int t = 1;
    //cin >> t;

    while (t--) {

        solve();

    }

    return 0;
}