[DP] baekjoon-11660

Author: Seogeurim

Diff for: README.md

@@ -124,4 +124,5 @@
 |  #  |   ☆    | Problem                                                                                                             | Note                      |
 | :-: | :----: | :------------------------------------------------------------------------------------------------------------------ | :------------------------ |
 | 01  |     | [Baekjoon-1932 정수 삼각형](https://github.com/Seogeurim/Algorithm-practice/blob/master/src/DP/P1932) |      |
-| 02  |     | [Baekjoon-11659 구간 합 구하기 4](https://github.com/Seogeurim/Algorithm-practice/blob/master/src/DP/P11659) |  누적합   |
+| 02  |     | [Baekjoon-11659 구간 합 구하기 4](https://github.com/Seogeurim/Algorithm-practice/blob/master/src/DP/P11659) |  누적합   |
+| 03  |     | [Baekjoon-11660 구간 합 구하기 5](https://github.com/Seogeurim/Algorithm-practice/blob/master/src/DP/P11660) |  누적합   |

Diff for: src/DP/P11660/Main.java

@@ -0,0 +1,46 @@
+package DP.P11660;
+
+import java.io.BufferedReader;
+import java.io.FileInputStream;
+import java.io.InputStreamReader;
+import java.util.StringTokenizer;
+
+public class Main {
+
+    static int N, M;
+    static int[][] nums;
+
+    public static void main(String[] args) throws Exception {
+        System.setIn(new FileInputStream("src/DP/P11660/input.txt"));
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        StringTokenizer st = new StringTokenizer(br.readLine());
+
+        N = Integer.parseInt(st.nextToken());
+        M = Integer.parseInt(st.nextToken());
+
+        nums = new int[N][N];
+
+        for (int i = 0; i < N; i++) {
+            st = new StringTokenizer(br.readLine());
+            for (int j = 0; j < N; j++) {
+                if (j == 0) nums[i][j] = Integer.parseInt(st.nextToken());
+                else nums[i][j] = nums[i][j-1] + Integer.parseInt(st.nextToken());
+            }
+        }
+
+        for (int i = 0; i < M; i++) {
+            st = new StringTokenizer(br.readLine());
+            int x1 = Integer.parseInt(st.nextToken()) - 1;
+            int y1 = Integer.parseInt(st.nextToken()) - 1;
+            int x2 = Integer.parseInt(st.nextToken()) - 1;
+            int y2 = Integer.parseInt(st.nextToken()) - 1;
+
+            int ans = 0;
+            for (int j = x1; j <= x2; j++) {
+                if (y1 > 0) ans += nums[j][y2] - nums[j][y1 - 1];
+                else ans += nums[j][y2];
+            }
+            System.out.println(ans);
+        }
+    }
+}

Diff for: src/DP/P11660/README.md

@@ -0,0 +1,3 @@
+## [baekjoon-11660] 구간 합 구하기 5
+
+![image](https://user-images.githubusercontent.com/22045163/90875246-d474f880-e3db-11ea-91bb-25015a1b23fb.png)

Diff for: src/DP/P11660/input.txt

@@ -0,0 +1,7 @@
+2 4
+1 2
+3 4
+1 1 1 1
+1 2 1 2
+2 1 2 1
+2 2 2 2