AcWing 797. 差分
原题链接
简单
作者:
Coinisi.
,
2022-12-12 19:48:31
,
所有人可见
,
阅读 167
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#include <cstring>
#define IOS std::ios::sync_with_stdio(false)
#define YES cout << "YES" << endl;
#define NO cout << "NO" << endl;
#define int long long
const int N = 100007;
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
int arr[N], b[N];
void insert(int l, int r, int c)
{
b[l] = b[l] + c;
b[r + 1] = b[r + 1] - c;
}
void solve()
{
int n, m; cin >> n >> m;
for(int i = 1; i <= n; i ++) cin >> arr[i];
while( m -- )
{
int l, r, c; cin >> l >> r >> c;
insert(l, r, c);
}
for(int i = 1; i <= n; i ++)
{
b[i] = b[i] + b[i - 1];
cout << b[i] + arr[i] << ' ';
}
cout << endl;
}
signed main()
{
IOS; int T = 1;
// cin >> T;
while( T -- ) solve();
return 0;
}