# 差分算法总结

https://www.acwing.com/problem/content/799/

#include <iostream>

using namespace std;

const int N = 100010;

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

void insert(int l, int r, int c)
{
b[l] += c;
b[r + 1] -= c;
}

int main()
{
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++)
{
scanf("%d", &x);
insert(i, i, x);
}

while (m--)
{
int l, r, c;
scanf("%d%d%d", &l, &r, &c);
insert(l, r, c);
}

for (int i = 1; i <= n; i++)
{
b[i] += b[i - 1];
printf("%d ", b[i]);
}

return 0;
}

https://www.acwing.com/problem/content/800/

#include <iostream>

using namespace std;

const int N = 1010;

int n, m, q, x;
int b[N][N];

void insert(int x1, int y1, int x2, int y2, int c)
{
b[x1][y1] += c;
b[x2 + 1][y1] -= c;
b[x1][y2 + 1] -= c;
b[x2 + 1][y2 + 1] += c;
}

int main()
{
scanf("%d%d%d", &n, &m, &q);

for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
{
scanf("%d", &x);
insert(i, j, i, j, x);
}

while (q--)
{
int x1, y1, x2, y2, c;
scanf("%d%d%d%d%d", &x1, &y1, &x2, &y2, &c);
insert(x1, y1, x2, y2, c);
}

for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= m; j++)
{
b[i][j] += b[i - 1][j] + b[i][j - 1] - b[i - 1][j - 1];
printf("%d ", b[i][j]);
}
puts("");
}

return 0;
}

posted @ 2023-11-27 23:33  ykycode  阅读(27)  评论(0编辑  收藏  举报