백준 11660번

원본 : https://www.acmicpc.net/problem/11660

11660번: 구간 합 구하기 5

 

풀이

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

public class Main {
    private static final BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));
    private static final StringBuilder stringBuilder = new StringBuilder();

    public static void main(String[] args) throws Exception {
        StringTokenizer stringTokenizer = new StringTokenizer(bufferedReader.readLine());
        int n = Integer.parseInt(stringTokenizer.nextToken());
        int m = Integer.parseInt(stringTokenizer.nextToken());
        int[][] arr = new int[n + 1][n + 1];


        for (int i = 1; i <= n; i++) {
            stringTokenizer = new StringTokenizer(bufferedReader.readLine());
            int index = 1;
            while (stringTokenizer.hasMoreTokens()) {
                arr[i][index] = arr[i][index - 1] + Integer.parseInt(stringTokenizer.nextToken());
                index++;
            }
        }

        for (int i = 0; i < m; i++) {
            stringTokenizer = new StringTokenizer(bufferedReader.readLine());
            int x1 = Integer.parseInt(stringTokenizer.nextToken());
            int y1 = Integer.parseInt(stringTokenizer.nextToken());
            int x2 = Integer.parseInt(stringTokenizer.nextToken());
            int y2 = Integer.parseInt(stringTokenizer.nextToken());
            int sum = 0;

            for (int row = x1; row <= x2; row++) {
                sum += arr[row][y2] - arr[row][y1 - 1];
            }

            stringBuilder.append(sum).append("\n");
        }

        System.out.println(stringBuilder);
    }
}