二维前缀和

前缀和

对于每次查询，只需执行sum[r]-sum[l-1] ，时间复杂度为O(1)

#include <iostream>

using namespace std;
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

const int N = 100010;
int n, m;
int a[N], s[N];

int main()
{
    IOS;
    cin >> n >> m;
    for (int i = 1; i <= n ;i ++) cin >> a[i];  // original array
    
    for (int i = 1; i <= n; i ++) s[i] = s[i - 1] + a[i];  // Prefix sum
    
    int l, r;
    while (m --)
    {
        cin >> l >> r;
        cout << s[r] - s[l - 1] << endl;  // output sum of [l, r]  : s[r] - s[l - 1]
    }
    
    return 0;
}

二维矩阵前缀和
子矩阵的和

#include <iostream>
using namespace std;

const int N = 1010;
int n, m, q;
int a[N][N], s[N][N];

#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)

int main()
{
    IOS;
    cin >> n >> m >> q;
    for (int i = 1; i <= n; i ++)
        for (int j = 1; j <= m; j++)
        { 
            cin >> a[i][j];
            s[i][j] = s[i-1][j] + s[i][j-1] - s[i - 1][j - 1] + a[i][j];
        }
    
    while (q --) {
        int x1, x2, y1, y2;
        cin >> x1 >> y1 >> x2 >> y2;
        cout << s[x2][y2] - s[x1 - 1][y2] - s[x2][y1 - 1] + s[x1 - 1][y1 - 1] << endl;
    }
    
    
    return 0;
}