前缀和(一维和二维)

一维前缀和：

例题：


思路： 先求出前缀和s[i] = s[i - 1] + a[i],然后l到r之间的和就等于前缀和s[r] - s[l - 1]
代码：

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

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

int main()
{
    scanf("%d %d",&n,&m);
    for(int i = 1;i <= n;i++)
    {
        scanf("%d",&a[i]);
        s[i] = s[i - 1] + a[i];
    }
    for(int j = 0;j < m;j++)
    {
        int l,r;
        scanf("%d %d",&l,&r);
        printf("%d\n",s[r] - s[l - 1]);
    }
    
    return 0;
}

二维前缀和：

例题：


代码：

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

const int N = 1010;
int n,m,q;
int a[N][N],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",&a[i][j]);
            s[i][j] = s[i - 1][j] + s[i][j - 1] - s[i - 1][j - 1] + a[i][j];
        }
    }
    for(int i = 0;i < q;i++)
    {
        int x1,y1,x2,y2;
        scanf("%d %d %d %d",&x1,&y1,&x2,&y2);
        printf("%d\n",s[x2][y2] - s[x2][y1 - 1] - s[x1 - 1][y2] + s[x1 - 1][y1 - 1]);
    }
    
    return 0;
}