[BAE/<JOON> 문제풀이] 2167. 배열의 합 (DP.025)

https://www.acmicpc.net/problem/2167

2167번: 2차원 배열의 합

#include <iostream>
#include <vector>

using namespace std;

int main()
{
    struct coor {
        int x1, y1, x2, y2;
    };
    vector<vector<int> > arr;
    int n, m;
    cin >> n >> m;
    arr.resize(n + 1);
    for (int i = 1; i <= n; i++) {
        arr[i].resize(m + 1);
        for (int j = 1; j <= m; j++) {
            cin >> arr[i][j];
        }
    }
    int k;
    cin >> k;
    vector<coor> c;
    c.resize(k + 1);
    for (int i = 1; i <= k; i++) {
        int x1, y1, x2, y2;
        cin >> x1 >> y1 >> x2 >> y2;
        int sum = 0;
        for (int j = x1; j <= x2; j++) {
            for (int l = y1; l <= y2; l++) {
                sum += arr[j][l];
            }
        }
        cout << sum << endl;
    }
    return 0;
}