前缀和和差分

a是一个数组，s记录前多少个a的和，在做题时这一思想经常被使用。

#include <iostream>
using namespace std;
const int N=1e6+10;
int n,m;
int a[N],s[N];

int main(){
    cin>>n>>m;
    for(int i=1;i<=n;i++){
        scanf("%d",&a[i]);
        s[i]=s[i-1]+a[i];
    }
    for(int i=0;i<m;i++){
        int b,c;
        scanf("%d%d",&b,&c);
        printf("%d\n",s[c]-s[b-1]);
    }
}

二维数组：

#include <iostream>

using namespace std;

const int N = 1010;

int n, m, q;
int s[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 ++ ){
            scanf("%d", &s[i][j]);

            s[i][j] += s[i - 1][j] + s[i][j - 1] - s[i - 1][j - 1];
}}
    while (q -- )
    {
        int x1, y1, x2, y2;
        scanf("%d%d%d%d", &x1, &y1, &x2, &y2);
        printf("%d\n", s[x2][y2] - s[x1 - 1][y2] - s[x2][y1 - 1] + s[x1 - 1][y1 - 1]);
    }

    return 0;
}

差分

#include <iostream>

using namespace std;

const int N = 1e6+10;

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

int main()
{
    scanf("%d%d", &n, &m);
    
    for(int i=1;i<=n;i++){scanf("%d",&b[i]);a[i]=b[i]-b[i-1];}
    while(m--){
        int i,j,k;
        cin>>i>>j>>k;
        a[i]+=k;
        a[j+1]-=k;
    }
    int c=0;
    for(int i=1;i<=n;i++){c+=a[i];printf("%d ",c);};
}

#include <iostream>

using namespace std;

const int N = 1010;

int n, m, q;
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()
{
    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]);

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

    while (q -- )
    {
        int x1, y1, x2, y2, c;
        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];//相当于求波前缀和

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

    return 0;
}