AcWing 796. 子矩阵的和
原题链接
简单
作者:
恒心
,
2021-01-24 17:27:27
,
所有人可见
,
阅读 252
import java.util.*;
import java.io.*;
class Main{
public static void main(String[] args) throws Exception{
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int m = sc.nextInt();
int q = sc.nextInt();
sc.nextLine();
int[][] num = new int[n + 1][m + 1];
for(int i = 1; i <= n; ++i){
String[] numChar = sc.nextLine().split(" ");
for(int j = 1; j <= m; ++j){
num[i][j] = Integer.parseInt(numChar[j - 1]);
}
}
for(int i = 1; i <= n; ++i){
for(int j = 1; j <= m; ++j){
num[i][j] += num[i][j-1] + num[i-1][j] - num[i-1][j-1];
}
}
for(int i = 0; i < q; ++i){
String[] line = sc.nextLine().split(" ");
int x1 = Integer.parseInt(line[0]);
int y1 = Integer.parseInt(line[1]);
int x2 = Integer.parseInt(line[2]);
int y2 = Integer.parseInt(line[3]);
System.out.println(num[x2][y2] + num[x1 - 1][y1 - 1] - num[x2][y1 - 1] - num[x1 - 1][y2]);
}
}
}