Merge pull request #60 from AlgoLeadMe/16-SeongHoonC

16-SeongHoonC

SeongHoonC/README.md

@@ -17,4 +17,5 @@
 | 13차시 | 2024.03.03 | bfs | <a href="https://www.acmicpc.net/problem/14940"></a> |https://github.com/AlgoLeadMe/AlgoLeadMe-6/pull/49 |
 | 14차시 | 2024.03.06 | dfs | <a href="https://school.programmers.co.kr/learn/courses/30/lessons/64064"></a> |https://github.com/AlgoLeadMe/AlgoLeadMe-6/pull/50 |
 | 15차시 | 2024.03.09 | 분할정복 | <a href="https://www.acmicpc.net/problem/1629"></a> |https://github.com/AlgoLeadMe/AlgoLeadMe-6/pull/55 |
+| 16차시 | 2024.03.14 | 누적합 | <a href="https://www.acmicpc.net/problem/11659"></a> |https://github.com/AlgoLeadMe/AlgoLeadMe-6/pull/60 |
 ---

SeongHoonC/누적합/구간 합 구하기 4.kt

@@ -0,0 +1,28 @@
+import java.io.BufferedReader
+import java.io.BufferedWriter
+import java.io.InputStreamReader
+import java.io.OutputStreamWriter
+
+fun main() {
+    val br = BufferedReader(InputStreamReader(System.`in`))
+    val bw = BufferedWriter(OutputStreamWriter(System.out))
+    val (n, m) = br.readLine().split(" ").map { it.toInt() }
+    val nums = br.readLine().split(" ").map { it.toInt() }
+    val addedSum = Array(n + 1) { 0 }
+    addedSum[1] = nums[0]
+
+    // i 까지 누적합 구하기
+    for (i in 2..n) {
+        addedSum[i] = addedSum[i - 1] + nums[i - 1]
+    }
+
+    // 누적합 end 에서 누적합 start - 1 를 빼서 start ~ end 구간 합 구하기
+    for (i in 0 until m) {
+        val (start, end) = br.readLine().split(" ").map { it.toInt() }
+        bw.write((addedSum[end] - addedSum[start - 1]).toString())
+        bw.newLine()
+    }
+    // BufferedWriter 로 한번에 출력
+    bw.flush()
+    bw.close()
+}