差分模板(一维,二维)

一维差分:
给定a[1],a[2],...a[n]
构造差分数组b[n],使得
a[i] = b[1] + b[2] + ... + b[i]

核心操作:将a[L~R]全部加上C,等价于:

$b[L]+=C,b[R+1]-=C$

分析:
1.a[1~L-1]无影响
2.a[L~R]加上了C
3.a[R+1~n]无影响

一维差分模板(两种)
用两个数组

#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;
}

---

用一个数组 $a[i]-a[i-1]=b[i]$ 要倒着求差分数组,不然前面的会影响后面的

#include <iostream>

using namespace std;

const int N = 100010;

int n, m;
int s[N];

int main()
{
    cin >> n >> m;
    for (int i = 1; i <= n; i ++ ) scanf("%d",&s[i]);
    for (int i = n; i; i -- ) s[i] -= s[i - 1];

    while (m -- )
    {
        int l, r, c;
        scanf("%d%d%d",&l,&r,&c);
        s[l] += c, s[r + 1] -= c;
    }

    for (int i = 1; i <= n; i ++ ) s[i] += s[i - 1];

    for (int i = 1; i <= n; i ++ ) printf("%d ",s[i]);

    return 0;
}

---

二维差分:
给定原矩阵a[i][j],构造差分矩阵b[i][j],使得a[][]是b[][]的二维前缀和

差分核心操作:给以(x1,y1)为左上角,(x2,y2)为右下角的子矩阵中的所有数a[i,j],加上C

对于差分数组的影响:

$b[x1][y1]+=C$
$b[x1][y2+1]-=C$
$b[x2+1][y1]-=C$
$b[x2+1][y2+1]+=C$

二维差分模板(两种)
用两个数组

#include <iostream>
#include <cstdio>

using namespace std;

const int N = 1010;

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

void insert(int x1,int y1,int x2,int y2,int c)
{
    b[x1][y1] += c;
    b[x1][y2+1] -= c;
    b[x2+1][y1] -= 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++)
        {
            int tmp;
            scanf("%d",&tmp);
            insert(i,j,i,j,tmp);
        }
    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++)
        {
            a[i][j] = a[i-1][j] + a[i][j-1] - a[i-1][j-1] + b[i][j];
            printf("%d ",a[i][j]);
        }
        printf("\n");
    }
    return 0;
}

---

用一个数组

#include <iostream>

using namespace std;

typedef long long ll;

const int N = 1010;
const int inf = 0x3f3f3f;

int n, m, q;
int a[N][N];

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

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

    while (q -- )
    {
        int x1, y1, x2, y2, c;
        scanf("%d%d%d%d%d", &x1, &y1, &x2, &y2, &c);
        a[x1][y1] += c;
        a[x2 + 1][y1] -= c;
        a[x1][y2 + 1] -= c;
        a[x2 + 1][y2 + 1] += c;
    }

    for (int i = 1; i <= n; i ++ )
        for (int j = 1; j <= m; j ++ )
            a[i][j] += a[i - 1][j] + a[i][j - 1] - a[i - 1][j - 1];

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

    return 0;