前缀和与差分

二维数组的前缀和

#include <iostream>

using namespace std;
const int N = 1010;

int a[N][N], sum[N][N];
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];
            sum[i][j] = sum[i-1][j] + sum[i][j-1] - sum[i-1][j-1] + a[i][j]; // 初始化前缀和数组
        }
    
    int x1, y1, x2, y2;   
    while (q--)
    {
        cin >> x1 >> y1 >> x2 >> y2; // 左上角和右下角
        int ans = sum[x2][y2] - sum[x2][y1-1] - sum[x1-1][y2] + sum[x1-1][y1-1];
        cout << ans << endl;
    }
    return 0;
}

 

差分

差分就是数据间的差。是原始数组的相邻元素之间的差值，有b[i]=a[i+1]-a[i].

#include <iostream>
#include <cstdio>
using namespace std;

const int N = 100010;
int a[N], b[N];

void insert(int l, int r, int c) // 为[l, r]区间的数都加上c
{
    b[l] += c;
    b[r + 1] -= c;
}
int main()
{
    int n, m;
    scanf("%d%d", &n, &m);
    
    for (int i = 1; i <= n; i++)
    {
        scanf("%d", &a[i]);
        insert(i, i, a[i]); // 初始化差分数组, 将a,b开始均看作全为0的数组, a[i]为对区间[i, i]加上的值
    }
    
    int l, r, c;
    while (m--)
    {
        scanf("%d%d%d", &l, &r, &c);
        insert(l, r, c);
    }
    
    int ans = 0;
    for (int i = 1; i <= n; i++)
    {
        ans += b[i];
        printf("%d ", ans);
    }
    
    
    return 0;
}

 

二维数组的差分

#include <iostream>

using namespace std;

const int N = 1010;

int sum[N][N], b[N][N];

// 对以(x1,y1)为左上角以(x2,y2)为右下角的矩形区域全部加上c
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()
{
    int n, m, q;
    cin >> n >> m >> q;
    
    for (int i = 1; i <= n; i++)
        for( int j = 1; j <= m; j++)
        {
            cin >> sum[i][j];
            insert(i, j, i, j, sum[i][j]); //初始化差分数组
        }
    
    int x1, y1, x2, y2, c;    
    while(q--)
    {
        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];
            cout << b[i][j] << " ";
        }
        cout << endl;
    }
    
    return 0;
}