题解 | 【模板】差分
inline void solve()
{
cin >> n >> m;
recin(a, n);
rep(i, 1, n)
{
d[i] = a[i] - a[i - 1];
}
while (m--)
{
cin >> l >> r >> k;
d[l] += k;
d[r + 1] -= k;
}
rep(i, 1, n)
{
a[i] = a[i - 1] + d[i];
cout << a[i] << " ";
}
}
查看1道真题和解析