【差分】一维差分 与 二维差分

差分:

前缀和的逆运算

acwing 797 差分

AcWing 797. 差分 【c++详细题解】 - AcWing

一维差分

//差分 时间复杂度 o(m)
#include<iostream>
using namespace std;
const int N = 1e5 + 10;
int a[N], b[N];
int main()
{
    int n, m;
    scanf("%d%d", &n, &m);
    for (int i = 1; i <= n; i++)
    {
        scanf("%d", &a[i]);
        b[i] = a[i] - a[i - 1];      //构建差分数组
    }
    int l, r, c;
    while (m--)
    {
        scanf("%d%d%d", &l, &r, &c);
        b[l] += c;     //将序列中[l, r]之间的每个数都加上c
        b[r + 1] -= c;
    }
    for (int i = 1; i <= n; i++)
    {
        a[i] = b[i] + a[i - 1];    //前缀和运算
        printf("%d ", a[i]);
    }
    return 0;
}

y总写法

#include<iostream>

using namespace std;

const int N = 100010;

int n, m;
int a[N], 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", &a[i]);
	
	for(int i = 1; i <= n; ++ i) insert(i,i,a[i]);
	
	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];
	
	for(int i = 1; i <= n; ++ i) printf("%d ",b[i]);
	
	return 0;
}

6 3
1 2 2 1 2 1
1 3 1
3 5 1
1 6 1

3 4 5 3 4 2

二维差分 acwing 798

#include<iostream>
#include<cstdio>
using namespace std;
const int N = 1e3 + 10;
int a[N][N], b[N][N];
void insert(int x1, int y1, int x2, int y2, int c)
{
    b[x] += c;
    b[x2 + 1][y1] -= c;
    b[x1][y2 + 1] -= c;
    b[x2 + 1][y2 + 1] += c;
}
int main()
{
    int n, m, q;
    cin >> n >> m >> q;
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j++)
            cin >> a[i][j];
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= m; j++)
        {
            insert(i, j, i, j, a[i][j]);      //构建差分数组
        }
    }
    while (q--)
    {
        int x1, y1, x2, y2, c;
        cin >> 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];  //二维前缀和
        }
    }
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= m; j++)
        {
            printf("%d ", b[i][j]);
        }
        printf("\n");
    }
    return 0;
}

3 4 3
1 2 2 1
3 2 2 1
1 1 1 1
1 1 2 2 1
1 3 2 3 2
3 1 3 4 1

2 3 4 1
4 3 4 1
2 2 2 2

#include<iostream>

using namespace std;

const int N = 1010;

int n, m, q;
int a[N][N], 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", &a[i][j]);
			
	for(int i = 1; i <= n; ++ i)
		for(int j = 1; j <=m; ++ j)
			insert(i,j,i,j,a[i][j]);
	
	while(q --)
	{
		int x1, y1, x2, y2, c;
		cin>> 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];
	
	for(int i = 1; i <= n; ++ i)
	{
		for(int j = 1; j <=m; ++ j) printf("%d ",b[i][j]);
			puts("");
	}

	
	return 0;
}

差分的个人总结

在理解代码时 我们可以直接看成就是在0 0 0 的数组区间中不断的插数, 最后a[i]=b[1] + b[2] +... + b[i];
这个求前缀和的行为 我们可以直接在b数组上完成