AcWing 797. 差分
原题链接
简单
作者:
小王子_19
,
2024-03-29 11:25:39
,
所有人可见
,
阅读 1
因为我的下标是从0开始的,所以b[0]还少个a[0],然后后面,是从[l - 1, r - 1]这个区间要加,
那么就得从b[l - 1] + c 然后是b[r] - c 就行了
C++ 代码
#include <cstdio>
#include <iostream>
using namespace std;
const int N = 100010;
int a[N], b[N];
int n, m;
int main()
{
cin >> n >> m;
for (int i = 0; i < n; i ++ ) scanf("%d", &a[i]);
for (int i = 1; i < n; i ++ )
b[i] = a[i] - a[i - 1];
b[0] = a[0];
for (int i = 0; i < m; i ++ )
{
int l = 0, r = 0, c = 0;
scanf("%d%d%d", &l, &r, &c);
b[l - 1] += c, b[r] -= c;
}
int s = 0;
for (int i = 0; i < n; i ++ ) printf("%d ", s += b[i]);
return 0;
}