$\huge \color{orange}{成仙之路->}$ $\huge \color{purple}{算法基础课题解}$

完整代码

#include<bits/stdc++.h>

using namespace std;

const int N = 1010;

int n,m,q;
int a[N][N],s[N][N];

int main()
{
    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]; //求前缀和s[i][j]
        }

    while(q--)
    {
        int x1,y1,x2,y2;
        cin>>x1>>y1>>x2>>y2;
        cout<<s[x2][y2]-s[x2][y1-1]-s[x1-1][y2]+s[x1-1][y1-1]<<endl; //求解部分和
    }

    return 0;
}