2167 2차원 배열의 합

#include <stdio.h>
 
int arr[305][305] = { 0 };
int dp[305][305] = { 0 };
 
int main() {
    int n, m;
    scanf("%d %d", &n, &m);
 
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            scanf("%d", &arr[i][j]);
            
            dp[i][j] = (dp[i - 1][j] + dp[i][j - 1] - dp[i - 1][j - 1]) + arr[i][j];
        }
    }
 
    int t;
    scanf("%d", &t);
 
    while (t--) {
        int i, j, x, y, rst = 0;
        scanf("%d %d %d %d", &i, &j, &x, &y);
 
        rst = (dp[x][y] - dp[x][j - 1] - dp[i - 1][y] + dp[i - 1][j - 1]);
        printf("%d\n", rst);
    }
}