ALG：前缀和与差分

终于动手写了…

1 一维前缀和

si = a1 + a2 + ... + ai;

[l, r] sum = s[r] - s[l - 1];

//求一维前缀和
#include<bits/stdc++.h>
using namespace std;
const int N = 100010;
int s[N];//全局变量初始化为0
int main()
{
    int n, m, l, r, tmp;
    scanf("%d %d", &n, &m);
    for(int i = 1; i <= n; i++)
    {
        scanf("%d", &tmp);
        s[i] = s[i - 1] + tmp;//数从1开始
    }
    while(m--)
    {
        scanf("%d %d", &l, &r);
        printf("%d\n", s[r] - s[l - 1]); 
    }
    return 0;
}

2 二维前缀和

s[i][j]是从[1][1]开始到[i][j]的矩阵和
s[i][j] = s[i - 1][j] + s[i][j - 1] - s[i - 1][j - 1] + a[i][j];

s[x2][y2] - s[x1 - 1][y2] - s[x2][y1 - 1] + s[x1 - 1][y1 - 1];

//求二维前缀和
#include<bits/stdc++.h>
using namespace std;
const int N = 1010;
int s[N][N];
int get_sum(int x1, int y1, int x2, int y2)
{
    return s[x2][y2] - s[x1 - 1][y2] - s[x2][y1 - 1] + s[x1 - 1][y1 - 1];
}
int main()
{
    int n, m, q, tmp, x1, x2, y1, y2;
    scanf("%d %d %d", &n, &m, &q);
    for(int i = 1; i <= n; i++)
    {
        for(int j = 1; j <= m; j++)
        {
            scanf("%d", &tmp);
            s[i][j] = s[i - 1][j] + s[i][j - 1] - s[i - 1][j - 1] + tmp;
        }
    }
    while(q--)
    {
        scanf("%d %d %d %d", &x1, &y1, &x2, &y2);
        printf("%d\n", get_sum(x1, y1, x2, y2));
    }
    return 0;
}

附 CCF CSP 202104-2的代码

#include<bits/stdc++.h>
using namespace std;
const int N = 610;
int a[N][N];
int get_sum(int x1, int y1, int x2, int y2)
{
    return a[x2][y2] - a[x1 - 1][y2] - a[x2][y1 - 1] + a[x1 - 1][y1 - 1];
}
int get_cnt(int x1, int y1, int x2, int y2)
{
    return (x2 - x1 + 1) * (y2 - y1 + 1);
}
int main()
{
    int n, L, r, t;
    scanf("%d %d %d %d", &n, &L, &r, &t);
    for(int i = 1; i <= n; i++)
    {
        for(int j = 1; j <= n; j++)
        {
            int tmp;
            scanf("%d", &tmp);
            a[i][j] = a[i - 1][j] + a[i][j - 1] - a[i - 1][j - 1] + tmp;
        }
    }
    int cnt = 0;
    for(int i = 1; i <= n; i++)
    {
        for(int j = 1; j <= n; j++)
        {
            int x1 = max(1, i - r), y1 = max(1, j - r);
            int x2 = min(n, i + r), y2 = min(n, j + r);
            if(get_sum(x1, y1, x2, y2) <= t * get_cnt(x1, y1, x2, y2))
                cnt++;
        }
    }
    cout << cnt;
    return 0;
}

3 一维差分

差分是前缀和的逆运算

已知a1, a2, ..., an  前缀和
构造b1, b2, ..., bn  差分
使得ai = b1 + b2 + ... + bi;
b1 = a1;
b2 = a2 - a1;
bi = ai - ai-1;

差分应用：给a数组[l, r]区间内每一个数都加上一个c，可以通过操作b数组，再对b数组求前缀和得到，每次操作将复杂度从O(n)降到O(1)
al + c, al+1 + c, ..., ar + c
bl' = al + c - al-1 = bl +c（更改）
bl+1' = bl+1 + c - (bl + c) = bl+1;
br+1' = br+1 - (br + c) = br+1 + c;（更改）

#include<bits/stdc++.h>
using namespace std;
const int N = 100010;
int a[N], b[N];
void insert(int l, int r, int c)
{
    b[l] += c;
    b[r + 1] -= c;
}
int main()
{
    int n, m, l, r, c;
    scanf("%d%d", &n, &m);
    for(int i = 1; i <= n; i++)
    {
        scanf("%d", &a[i]);
        insert(i, i, a[i]);//初始也可以看作b是0，然后在[0,0]区间上插入a0,即b0 + a0, b1 - a0后续还会加上a1
    }
    while(m--)
    {
        scanf("%d%d%d", &l, &r, &c);
        insert(l, r, c);
    }

    for(int i = 1; i <= n; i++)
    {
        a[i] = b[i] + a[i - 1];
        cout << a[i] << " ";
    }
    return 0;
}

4 二维差分

保证a数组是b数组的前缀和，在a数组的一个子矩阵上加c

图中画的还算清楚，bx1,y1 +=c就会导致算前缀和包含这个点的a数组中的值都会+c，其他同理。

#include<bits/stdc++.h>
using namespace std;
const int N =  1010;
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()
{
    int n, m, x1, x2, y1, y2, c, q;
    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]);
            insert(i, j, i, j, a[i][j]);
        }
    }
    while(q--)
    {
        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];
            cout << a[i][j] << " "; 
        }
        cout << endl;
    }
    return 0;
}

注：
我们不必说去构造差分序列、差分矩阵，我们只需要将原始的a序列全部视为0，那么b序列也为0。然后对于a中的每个值我们都把他看成c值插入即可（一个元素的序列，1*1的矩阵）