前缀和与差分

前缀和

#include <iostream>
using namespace std;

int n, a[125][125], qz[125][125], ans;
int max(int a, int b) {
    if(a > b) return a;
    else return b;
}

int main() {
    cin >> n;
    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= n; j++)
            cin >> a[i][j];
    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= n; j++)
            qz[i][j] = a[i][j] + qz[i - 1][j] + qz[i][j - 1] - qz[i - 1][j - 1];
    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= n; j++)
            for(int k = i; k <= n; k++)
                for(int l = j; l <= n; l++)
                    ans = max(ans, qz[k][l] - qz[k][j - 1] - qz[i - 1][l] + qz[i - 1][j - 1]);
    cout << ans << endl;
    return 0;
}

差分

Luogu P3397 地毯

int n, m, ans;
int cf[1005][1005];
int main() {
    cin >> n >> m;
    for(int i = 1; i <= m; i++) {
        int tmpa, tmpb, tmpc, tmpd;
        cin >> tmpa >> tmpb >> tmpc >> tmpd;
        for(int j = tmpa; j <= tmpc; j++) 
            cf[j][tmpb] += 1, cf[j][tmpd + 1] -= 1;
    }
    for(int i = 1; i <= n + 1; i++) {
        for(int j = 1; j <= n + 1; j++) {
            ans += cf[i][j];
            if(i > n || j > n) continue;
            cout << ans << " ";
        }
        cout << endl;
    }
    return 0;
}